7.Flow-shop Scheduling Problem with Weighted Work-In-Process

This paper considers a new flow-shop scheduling problem where a different WIP (workin-process) state has different weight on the duration time. For the two machine case, the recognition version is NP-Complete in the strong sense. Several special cases are solved by different polynomial time algorithms. Finally, we develop a heuristic and provide an upper-bound on relative error which is tight in limit.

[1]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

[2]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[3]  Han Hoogeveen,et al.  Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases , 1999, Math. Oper. Res..

[4]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

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

[6]  Hirofumi Matsuo.  Cyclic sequencing problems in the two‐machine permutation flow shop: Complexity, worst‐case, and average‐case analysis , 1990 .

[7]  William L. Maxwell,et al.  The Role of Work-in-Process Inventory in Serial Production Lines , 1988, Oper. Res..

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

[9]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[10]  Chengen Wang,et al.  Efficient heuristic and optimal approaches for n/2/F/[sigma]Ci scheduling problems , 1996 .

[11]  V. Sridharan,et al.  Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review , 2000, Oper. Res..

[12]  Chelliah Sriskandarajah,et al.  The complexity of scheduling jobs in repetitive manufacturing systems , 1993 .