Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem

We investigate the multiprocessor multi-stage open shop and flow shop scheduling problem. In both problems, there are s stages each consisting of a number mi of parallel identical machines for 1 ≤ i ≤ s. Each job consists of s operations with one operation for each stage. The goal is to find a non-preemptive schedule that minimizes the makespan. We propose polynomial time approximation schemes for the multiprocessor open shop and flow shop scheduling problem when the number of stages s is constant and the numbers of machines mi are non-constant.

[1]  Gerhard J. Woeginger,et al.  Approximation algorithms for the multiprocessor open shop scheduling problem , 1999, Oper. Res. Lett..

[2]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[3]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[4]  Vitaly A. Strusevich,et al.  Worst-case analysis of heuristics for open shops with parallel machines , 1993 .

[5]  Gerhard J. Woeginger,et al.  A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem , 2000, Theor. Comput. Sci..

[6]  Bo Chen.  Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage , 1995 .

[7]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[9]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[10]  Klaus Jansen,et al.  Makespan minimization in job shops: a polynomial time approximation scheme , 1999, STOC '99.

[11]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[12]  Gerhard J. Woeginger,et al.  Makespan minimization in open shops: A polynomial time approximation scheme , 1998, Math. Program..

[13]  Han Hoogeveen,et al.  Short Shop Schedules , 1997, Oper. Res..

[14]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[15]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[16]  Leslie A. Hall.  Approximability of flow shop scheduling , 1998, Math. Program..