|
ZUO Yan
GU Hanyu
XI Yugeng
Institute of Automation,
Shanghai Jiaotong University,
Shanghai 200240, China
|
|
|
MODIFIED BOTTLENECK-BASED PROCEDURE
FOR LARGE-SCALE FLOW-SHOP SCHEDULING PROBLEMS WITH BOTTLENECK*
Abstract:
A new bottleneck-based heuristic for large-scale flow-shop scheduling problems with a bottleneck is proposed, which is simpler but more tailored than the shifting bottleneck (SB) procedure. In this algorithm, a schedule for the bottleneck machine is first constructed optimally and then the non-bottleneck machines are scheduled around the bottleneck schedule by some effective dispatching rules. Computational results show that the modified bottleneck-based procedure can achieve a tradeoff between solution quality and computational time comparing with SB procedure for medium-size problems. Furthermore it can obtain a good solution in quite short time for large-scale scheduling problems.
Key words:
Flow-shop scheduling problem Heuristic Bottleneck machine |