MINIMIZING THE MAKESPAN IN THE 3-MACHINE ASSEMBLY-TYPE FLOWSHOP SCHEDULING PROBLEM

被引：240

作者：

LEE, CY

CHENG, TCE

LIN, BMT

机构：

[1] HONG KONG POLYTECH,DEPT MANAGEMENT,KOWLOON,HONG KONG

[2] NATL CHAIO TUNG UNIV,DEPT COMP & INFORMAT SCI,HSINCHU 30050,TAIWAN

来源：

MANAGEMENT SCIENCE | 1993年 / 39卷 / 05期

关键词：

FLOWSHOP; SCHEDULING; ASSEMBLY-TYPE PRODUCTION;

D O I：

10.1287/mnsc.39.5.616

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：616 / 625

页数：10

共 50 条

[31] A makespan study of the two-machine flowshop scheduling problem with a learning effect
Wu, Chin-Chia
[J]. JOURNAL OF STATISTICS & MANAGEMENT SYSTEMS, 2005, 8 (01): : 13 - 25
[32] Minimizing total flow time in a two-machine flowshop problem with minimum makespan
Gupta, JND
Neppalli, VR
Werner, F
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 69 (03) : 323 - 338
[33] Minimizing Makespan in Batch Machine Scheduling
Chung Keung Poon
Pixing Zhang
[J]. Algorithmica , 2004, 39 : 155 - 174
[34] Minimizing the Makespan in Flowshop Scheduling for Sustainable Rubber Circular Manufacturing
Yin, Peng-Yeng
Chen, Hsin-Min
Cheng, Yi-Lung
Wei, Ying-Chieh
Huang, Ya-Lin
Day, Rong-Fuh
[J]. SUSTAINABILITY, 2021, 13 (05) : 1 - 18
[35] Minimizing makespan in batch machine scheduling
Poon, CK
Zhang, PX
[J]. ALGORITHMICA, 2004, 39 (02) : 155 - 174
[36] Minimizing makespan in batch machine scheduling
Poon, CK
Zhang, PX
[J]. ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 386 - 397
[37] AN EXPERIMENTAL INVESTIGATION OF THE OCCURRENCE OF SPECIAL CASES IN THE 3-MACHINE FLOWSHOP PROBLEM
SMITS, AJM
BAKER, KR
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1981, 19 (06) : 737 - 741
[38] A three-agent scheduling problem for minimizing the makespan on a single machine
Lee, Wen-Chiung
Wang, Jen-Ya
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 106 : 147 - 160
[39] MINIMIZING THE NUMBER OF MACHINE IDLE INTERVALS WITH MINIMUM MAKESPAN IN A FLOWSHOP
LIAO, CJ
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1993, 44 (08) : 817 - 824
[40] Makespan minimization for m-machine permutation flowshop scheduling problem with learning considerations
Yu-Hsiang Chung
Lee-Ing Tong
[J]. The International Journal of Advanced Manufacturing Technology, 2011, 56 : 355 - 367

← 1 2 3 4 5 →