Approximation algorithms for shop scheduling problems with minsum objective

Journal of Scheduling

Volumn 5, Issue 4, 2002, Pages 287-305

  Queyranne, Maurice ^a   Sviridenko, Maxim ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Shop scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS;

APPROXIMATION ALGORITHMS; MULTIPROCESSOR SHOPS; SHOP SCHEDULING;

SCHEDULING;

EID: 0012589874     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.96     Document Type: Article

References (39)

1. Leighton FT, Maggs BM, Rao SB. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica 1994; 14:167-186.
2. Hall LA, Shmoys DB, Wein J. Scheduling to minimize average completion time: off-line and on-line algorithms. Proceedings of the 7th Symposium on Discrete Algorithms, 1996; 142-151.
3. Hall LA, Schulz AS, Shmoys DB, Wein J. Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research 1997; 22:513-544.
4. Chakrabarti S, Phillips C, Schulz A, Shmoys D, Stein C, Wein J. Improved scheduling algorithms for minsum criteria. Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming, ICALP'96, 646-657.
5. Queyranne M, Schulz AS. Polyhedral approaches to machine scheduling. Report 408/1994, Department of Mathematics, University of Technology, Berlin, Germany, November 1994; revised, October 1996.
6. Skutella M. Approximation and randomization in scheduling. Ph.D. Thesis, Faculty of Mathematics, Technical University of Berlin, Berlin, Germany, May 1998.
7. Shmoys DB. Using linear programming in the design and analysis of approximation algorithms: two illustrative examples. In Approximation Algorithms for Combinatorial Optimization, APPROX'98 Proceedings, 1998, Jansen K, Rolim J (eds), Lecture Notes in Computer Science, Vol. 1444. Springer: Berlin, 15-32.
8. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In Logistics of Production and Inventory, Graves SC, Rinnooy Kan AHG, Zipkin PH (eds), Handbooks in Operations Research and Management Science, Vol. 4. North-Holland: Amsterdam, The Netherlands, 1993; 445-522.
9. Queyranne M, Sviridenko M. A (2 + ε)-approximation algorithm for generalized preemptive open shop problem with minsum objective. In Integer Programming and Combinatorial Optimization, Aardal K, Gerards B (eds), Lecture Notes in Computer Science, Vol. 2081. Springer: Berlin, 361-369.
10. Hoogeveen H, Schuurman P, Woeginger G. Non-approximability results for scheduling problems with minsum criteria. In Integer Programming and Combinatorial Optimization, IPCO-VI Proceedings, 1998, Bixby RE, Boyd EA, Rios-Mercado RZ (eds), Lecture Notes in Computer Science, Vol. 1412. Springer: Berlin, 353-366.
11. Wolsey LA. Mixed integer programming formulations for production planning and scheduling problems. Invited talk at the 12th International Symposium on Mathematical Programming. MIT: Cambridge, NJ, August 1985.
12. Queyranne M. Polyhedral approaches to scheduling problems. Seminar presented at RUTCOR, Rutgers University, November 16, 1987.
13. Queyranne M. Structure of a simple scheduling polyhedron. Mathematical Programming 1993; 58:263-285.
14. Schulz AS. Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. In Integer Programming and Combinatorial Optimization, IPCO-V Proceedings, 1996, Cunningham WH, Queyranne M, McCormick ST (eds), Lecture Notes in Computer Science, Vol. 1084. Springer: Berlin, 301-315.
15. Applegate D, Cook W. A computational study of the job-shop scheduling problem. ORSA Journal on Computing 1991; 3:149-156.
16. Shmoys DB, Stein C, Wein J. Improved approximation algorithms for shop scheduling problems. SIAM Journal of Computing 1994; 23:617-632.
17. Goldberg LA, Paterson M, Srinivasan A, Sweedyk E. Better approximation guarantees for job-shop scheduling. SIAM Journal on Discrete Mathematics, to appear; Preliminary version in Proceedings of the 8th Symposium on Discrete Algorithms, 1997; 599-608.
18. Gonzalez T, Sahni S. Flowshop and jobshop schedules: complexity and approximation. Operations Research 1978; 26:36-52.
19. Achugbue JO, Chin FY. Scheduling the open shop to minimize mean flow time. SIAM Journal on Computing 1982; 11:709-720.
20. Feige U, Scheideler C. Improved bounds for acyclic job shop scheduling. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98, 1998. ACM Press: New York, NY, 624-633.
21. Czumaj A, Scheideler C. A new algorithmic approach to the general Lovasz local lemma with applications to schedulung and satisfiability problems. Proceedings of the 32 ACM Symposium on Theory of Computing (STOC), 2000.
22. Leighton FT, Maggs BM, Richa AW. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica 1999; 19:375-401.
23. Schuurman P, Woeginger GJ. Approximation algorithms for the multiprocessor open shop scheduling problem. Operation Research Letters 1999; 24:157-163.
24. Lawler EL, Luby MG, Vazirani VV. Scheduling open shops with parallel machines. Operations Research Letters 1982; 1:161-164.
25. Sevastianov S, Woeginger G. Makespan minimization in preemptive two machine job shops. Computing 1998; 60:73-79.
26. Anderson E, Jayram TS, Kimbrel T. Tighter bounds on preemptive job shop scheduling with two machines. Computing 2001; 67:355-364.
27. Munier A, Queyranne M, Schulz AS. Approximation bounds for a general class of precedence constrained parallel machine scheduling problem. In Integer Programming and Combinatorial Optimization, IPCO-VI Proceedings, 1998, Bixby RE, Boyd EA, Rios-Mercado RZ (eds), Lecture Notes in Computer Science, Vol. 1412. Springer: Berlin, 367-382.
28. Schulz AS, Skutella M. Random-based scheduling: new approximations and LP lower bounds. In Randomization and Approximation Techniques in Computer Science, Random'97 Proceedings, 1997, Rolim J (ed), Lecture Notes in Computer Science, Vol. 1269. Springer: Berlin, 119-133.
29. Goemans M, Queyranne M, Schulz AS, Skutella M, Wang Y. Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics 2002; 15:165-192.
30. Chekuri C, Motwani R, Natarajan B, Stein C. Approximation techniques for average completion time scheduling. Proceedings of the 8th Symposium on Discrete Algorithms, 1997; 609-618.
31. Schulz AS, Skutella M. The power of alpha-points in preemptive single machine scheduling. Journal of Scheduling 2002; 5:121-133.
32. Smith WE. Various optimizers for single-stage production. Naval Research and Logistics Quarterly 1956; 3: 59-66.
33. Baker KR. Introduction to Sequencing and Scheduling. Wiley: New York, 1974.
34. Schulz AS. Polytopes and Scheduling. Ph.D. Thesis, Faculty of Mathematics, Technical University of Berlin, Berlin, Germany, 1995.
35. Grötschel M, Lovász L, Schrijver A. Geometric Algorithms and Combinatorial Optimization. Springer: Berlin, 1988.
36. Chandra AK, Wong CK. Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing 1975; 4:249-263.
37. Alon N, Azar Y, Woeginger GJ, Yadid T. Approximation schemes for scheduling on parallel machines. Journal of Scheduling 1998; 1:55-66.
38. Lawler EL, Lenstra JK, Martel C, Simons B, Stockmeyer L. Pipeline scheduling: a survey. Report RJ 5738 (57717), IBM Research Division, San Jose, CA, 1987.
39. Queyranne M, Sviridenko M. New and improved algorithms for minsum shop scheduling. Proceedings of SOD A00, 871-878.