Better approximation guarantees for job-shop scheduling

SIAM Journal on Discrete Mathematics

Volumn 14, Issue 1, 2000, Pages 67-92

  Goldberg, Leslie Ann ^a   Paterson, Mike ^a   Srinivasan, Aravind ^b   Sweedyk, Elizabeth ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b LUCENT TECHNOLOGIES   (United States)

^c HARVEY MUDD COLLEGE   (United States)

Author keywords

Approximation; Guarantees; Job shop; Scheduling

Indexed keywords

EID: 0012533045     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199326104     Document Type: Article

References (23)

1. N. ALON, A parallel algorithmic version of the Local Lemma, Random Structures and Algorithms, 2 (1991), pp. 367-378.
2. N. ALON AND A. SRINIVASAN, Improved parallel approximation of a class of integer programming problems, Algorithmica, 17 (1997), pp. 449-462.
3. D. APPLEGATE AND W. COOK, A computational study of the job-shop scheduling problem, ORSA J. Comput, 3 (1991), pp. 149-156.
4. A. BAR-NOY, R. CANETTI, S. KUTTEN, Y. MANSOUR, AND B. SCHIEBER, Bandwidth allocation with preemption, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, NV, 1995, ACM, New York, 1995, pp. 616-625.
5. J. BECK, An algorithmic approach to the Lovász Local Lemma, Random Structures and Algorithms, 2 (1991), pp. 343-365.
6. J. CARLIER AND E PINSON, An algorithm for solving the job-shop problem, Management Sci., 35 (1989), pp. 164-176.
7. P ERDÖS AND L. LOVÁSZ, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets, A. Hajnal, R. Rado, and V. T. Sós, eds., Colloq. Math. Soc. Janos Bolyai 11, North Holland, Amsterdam, 1975, pp. 609-627.
8. U. FEIGE AND C. SCHEIDELER, Improved bounds for acyclic job shop scheduling, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, ACM, New York, 1998, pp. 624-633.
9. L. A. HALL, Approximability of flow shop scheduling, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 82-91.
10. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B SHMOYS, Sequencing and scheduling: algorithms and complexity, in Logistics of Production and Inventory, Handbooks Oper. Res. Management Sci., 4, S. C. Graves et al., eds., Elsevier, New York, 1993, pp. 445-522.
11. F. T. LEIGHTON, B. MAGGS, AND S. RAO, Packet routing and jobshop scheduling in O(congestion + dilation) steps, Combinatorica, 14 (1994), pp. 167-186.
12. F. T LEIGHTON, B. MAGGS, AND A RICHA, Fast algorithms for finding O(congestion + dilation) packet routing schedules, Combinatorica, 19 (1999), pp. 375-401.
13. S MAHAJAN, E. A. RAMOS, AND K. V. SUBRAHMANYAM, Solving some discrepancy problems in NC, in Proceedings of the Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 1346, Springer, New York, 1997, pp. 22-36.
14. P. MARTIN AND D. B. SHMOYS, A new approach to computing optimal schedules for the job-shop scheduling problem, in Proceedings of the MPS Conference on Integer Programming and Combinatorial Optimization, Vancouver, B.C., Canada, 1996, Lecture Notes in Comput. Sci. 1084, Springer, Berlin, 1996, pp. 389-403.
15. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
16. G. RAYZMAN, Approximation Techniques for Job-Shop Scheduling Problems, M.Sc. Thesis, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1996.
17. C. SCHEIDELER, Universal Routing Strategies for Interconnection Networks, Lecture Notes in Comput. Sci. 1390, Springer, New York, 1998.
18. J. P. SCHMIDT, A. SIEGEL, AND A. SRINIVASAN, Chernoff-Hoeffding bounds for applications with limited independence, SIAM J. Discrete Math., 8 (1995), pp. 223-250.
19. S. V. SEVAST'YANOV, Efficient construction of schedules close to optimal for the cases of arbitrary and alternative routes of parts, Soviet Math. Dokl., 29 (1984), pp. 447-450.
20. S. V. SEVAST'YANOV, Bounding algorithm for the routing problem with arbitrary paths and alternative servers, Kibernetika, 22 (1986), pp. 74-79, 134 (in Russian).
21. D. B. SHMOYS, C. STEIN, AND J. WEIN, Improved approximation algorithms for shop scheduling problems, SIAM J. Comput., 23 (1994), pp. 617-632.
22. YU. N. SOTSKOV AND N. V. SHAKLEVICH, NP-hardness of shopt-scheduling problems with three jobs, Discrete Appl. Math., 59 (1995), pp. 237-266.
23. D. P. WILLIAMSON, L. A. HALL, J. A. HOOGEVEEN, C. A. J. HURKENS, J. K. LENSTRA, S. V. SEVAST'YANOV, AND D. B. SHMOYS, Short shop schedules, Oper. Res., 45 (1997), pp. 288-294.