MODIFIED BOTTLENECK-BASED PROCEDURE FOR LARGE-SCALE FLOW-SHOP SCHEDULING PROBLEMS WITH BOTTLENECK

作     者：ZUO Yan GU Hanyu XI Yugeng 

作者机构：Institute of AutomationShanghai Jiaotong University Shanghai 200240 China 

出 版 物：《Chinese Journal of Mechanical Engineering》 (中国机械工程学报（英文版）)

年 卷 期：2006年第19卷第3期

页      面：356-361页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：This project is supported by National Natural Science Foundation of China (No.60274013  No.60474002)Shanghai City Development Found for Science and Technology  China(No.04DZ11008) 

主　　题：Flow shop scheduling problem Heuristic Bottleneck machine 

摘      要：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.