论文信息 - Note: On the two-machine no-idle flowshop problem

Note: On the two-machine no-idle flowshop problem

In this short note we study a two-machine flowshop scheduling problem with the additional no-idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000

[1] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[2] William L. Maxwell,et al. Theory of scheduling , 1967 .

[3] D. Pohoryles,et al. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[4] Milan Vlach,et al. Minimizing total completion time in a two-machine no-idle flowshop , 1998 .

[5] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..