Two-machine flow shop scheduling problems with no-wait jobs

详细信息	查看全文 | 推荐本文 |

• 作者：Bouquard ; J.-L. ; Billaut ; J.-C. ; Kubzin ; M.A. ; Strusevich ; V.A.
• 关键词：Flow shop ; No-wait ; Complexity ; Approximation
• 刊名：Operations Research Letters
• 出版年：2005
• 期刊代码：134_01676377
• 类别：et
• 出版时间：May, 2005
• 卷：33
• 期：3
• 页码：255-262
• 文件大小：192 K

摘要

In this paper we provide a fairly complete complexity classification of various versions of the two-machine permutation flow shop scheduling problem to minimize the makespan in which some of the jobs have to be processed with no-wait in process. For some version, we offer a fully polynomial-time approximation scheme and a Formula Not Shown -approximation algorithm.