Better approximation guarantees for job-shop scheduling

Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work and present further improvements for some important NP-hard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.

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

[2]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

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

[4]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[5]  Noga Alon,et al.  A Parallel Algorithmic Version of the Local Lemma , 1991, Random Struct. Algorithms.

[6]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

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

[8]  Aravind Srinivasan,et al.  Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.

[9]  Eugene L. Lawler,et al.  Sequencing and Scheduling: Algorithms and Complexity, in Logistics of production and inventory , 1993 .

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

[11]  N. V. Shakhlevich,et al.  NP-hardness of shop-scheduling problems with three jobs , 1995 .

[12]  Leslie A. Hall,et al.  Approximability of flow shop scheduling , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[13]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[14]  Natalia V. Shakhlevich,et al.  NP-hardness of Shop-scheduling Problems with Three Jobs , 1995, Discret. Appl. Math..

[15]  Aravind Srinivasan,et al.  Improved Parallel Approximation of a Class of Integer Programming Programming Problems , 1996, ICALP.

[16]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[17]  Edgar A. Ramos,et al.  Solving Some Discrepancy Problems in NC , 1997, Algorithmica.

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

[19]  Christian Scheideler,et al.  Universal Routing Strategies for Interconnection Networks , 1998, Lecture Notes in Computer Science.

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

[21]  Ran Canetti,et al.  Bandwidth Allocation with Preemption , 1999, SIAM J. Comput..

[22]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .