Approximability and in-approximability results for no-wait shop scheduling

We investigate the approximability of no-wait shop scheduling problems under the makespan criterion. In a flow shop, all jobs pass through the machines in the same ordering. In the more general job shop, the routes of the jobs are job-dependent. We present a polynomial time approximation scheme (PTAS) for the no-wait flow shop problem on any fixed number of machines. Unless P=NP, this result cannot be extended to the job shop problem on a fixed number of machines: We show that the no-wait job shop problem is APX-hard on (i) two machines with at most five operations per job, and on (ii) three machines with at most three operations per job.

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

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

[3]  Chris N. Potts,et al.  Two-Machine No-Wait Flow Shop Scheduling with Missing Operations , 1999, Math. Oper. Res..

[4]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[5]  Christos H. Papadimitriou,et al.  The Traveling Salesman Problem with Many Visits to Few Cities , 1984, SIAM J. Comput..

[6]  Jeffrey B. Sidney,et al.  A heuristic for the two-machine no-wait openshop scheduling problem † , 1999 .

[7]  Santosh S. Vempala,et al.  On The Approximability Of The Traveling Salesman Problem , 2006, Comb..

[8]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

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

[10]  Chelliah Sriskandarajah,et al.  A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups , 2000, Oper. Res. Lett..

[11]  Alessandro Agnetis,et al.  No-wait flow shop scheduling with large lot sizes , 1997, Ann. Oper. Res..

[12]  Robert D. Carr,et al.  Towards a 4/3 approximation for the asymmetric traveling salesman problem , 1999, SODA '00.

[13]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[14]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[15]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

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

[17]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[18]  Alan M. Frieze,et al.  On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.

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

[20]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[21]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Approach for Sequencing Groups of Identical Jobs , 1980, Oper. Res..

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

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