標題: MINIMIZING THE MAKESPAN IN THE 3-MACHINE ASSEMBLY-TYPE FLOWSHOP SCHEDULING PROBLEM
作者: LEE, CY
CHENG, TCE
LIN, BMT
資訊工程學系
Department of Computer Science
關鍵字: FLOWSHOP;SCHEDULING;ASSEMBLY-TYPE PRODUCTION
公開日期: 1-五月-1993
摘要: This paper considers minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. After problem formulation, we present a proof to show that the general version of this problem is strongly NP-complete. We then discuss a few polynomially solvable cases of the problem and present the solution algorithms. Next, a branch and bound solution scheme is suggested. Finally, three heuristics to find approximate solutions to the general problem are proposed and their error bounds are analyzed.
URI: http://hdl.handle.net/11536/14263
ISSN: 0025-1909
期刊: MANAGEMENT SCIENCE
Volume: 39
Issue: 5
起始頁: 616
結束頁: 625
顯示於類別:期刊論文