Makespan minimization in job shops: a polynomial time approximation scheme

In this paper we present a polynomial time approximation scheme for the job shop scheduling problem with fixed number of machines and fixed number of operations per job. The polynomial time approximation scheme can be extended to the case of job shop problems with release and delivery times, multiprocessor job shops, and dag job shops.

[1]  Sergey Vasil'evich Sevast'janov,et al.  on Some Geometric Methods in Scheduling Theory: A Survey , 1994, Discret. Appl. Math..

[2]  Sergey V. Sevastianov.  Nonstrict vector summationin multi-operation scheduling , 1998, Ann. Oper. Res..

[3]  David B. Shmoys,et al.  Approximation schemes for constrained scheduling problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[4]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

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

[6]  椿 常也,et al.  人の管理技術 Operation research , 1966 .

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

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

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

[10]  David B. Shmoys,et al.  Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better , 1992, Math. Oper. Res..

[11]  Aravind Srinivasan,et al.  Better approximation guarantees for job-shop scheduling , 1997, SODA '97.

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

[13]  C. N. Potts,et al.  Analysis of a linear programming heuristic for scheduling unrelated parallel machines , 1985, Discret. Appl. Math..

[14]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[15]  S. Sevast’yanov.  Bounding algorithm for the routing problem with arbitrary paths and alternative servers , 1986 .

[16]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[17]  David B. Shmoys,et al.  Near-Optimal Sequencing with Precedence Constraints , 1990, IPCO.