Short shop schedules

Operations Research

Volumn 45, Issue 2, 1997, Pages 288-294

  Williamson, D P ^a   Hall, L A ^b   Hoogeveen, J A ^c   Hurkens, C A J ^c   Lenstra, J K ^c,d   Sevast'janov, S V ^e   Shmoys, D B ^f  

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

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d CWI   (Netherlands)

^e SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^f Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; OPERATIONS RESEARCH; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

INTEGRAL PROCESSING TIMES; POLYNOMIAL-TIME ALGORITHMS;

PRODUCTION CONTROL;

EID: 0031100831     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.45.2.288     Document Type: Article

References (19)

1. ADAMS, J., E. BALAS, AND D. ZAWACK. 1988. The Shifting Bottleneck Procedure for Job-shop Scheduling. Mgmt. Sci. 34, 391-401.
2. AFPLEGATE, D. AND W. COOK. 1991. A Computational Study of the Job-shop Scheduling Problem. ORSA J. Comput. 3, 149-156.
3. BALAS, E. 1985. On the Facial Structure of Scheduling Polyhedra. Math. Programming Stud. 24, 179-218.
4. BÁRÁNY, I. AND T. FIALA. 1982. Többgépes Ütemezési Problćmák közel Optimális Megoldása. Szigma-Mat.-Közgazdasági Folyóirat 15, 177-191.
5. BONDY, J. A. AND U. S. R. MURTY. 1976. Graph Theory with Applications. American Elsevier, New York, and MacMillan, London.
6. max) Problem. Naval Res. Logist. 20, 57-67.
7. CARLIER, J. AND E. PINSON. 1989. An Algorithm for Solving the Job-shop Problem. Mgmt. Sci. 35, 164-176.
8. CARLIER, J. AND E. PINSON. 1990. A Practical use of Jackson's Preemptive Schedule for Solving the Job-shop Problem. Ann. O.R. 26, 269-287.
9. DELL'AMICO, M. AND M. TRUBIAN. 1993. Applying Tabu Search to the Job-shop Scheduling Problem. Ann. O.R. 41, 231-252.
10. FISHER, M. L., B. J. LAGEWEG, J. K. LENSTRA, AND A. H. G. RINNOOY KAN. 1983. Surrogate Duality Relaxation for Job Shop Scheduling. Discrete Appl. Math. 5, 65-75.
11. GAREY, M. R. AND D. S. JOHNSON. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York.
12. JOHNSON, S. M. 1954. Optimal Two- and Three-stage Production Schedules with Setup Times Included. Naval Res. Logist, l, 61-68.
13. LAGEWEG, B. J., J. K. LENSTRA, AND A. H. G. RINNOOY KAN. 1977. Job-shop Scheduling by Implicit Enumeration. Mgmt. Sci. 24, 441-450.
14. LAWLER, E. L., J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS. 1993. Sequencing and Scheduling: Algorithms and Complexity. In S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin (eds.). Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory. North-Holland.
15. LOVÁSZ, L. AND M. D. PLUMMER. 1986. Matching Theory. Akadémiai Kiadó, Budapest and North-Holland, Amsterdam.
16. SCHMIDT, J. P., A. SIEGEL, AND A. SRINIVASAN. 1995. ChernoffHoeffding Bounds for Applications with Limited Independence. SIAM J. Discrete Math. 8, 223-250.
17. SHMOYS, D. B., C. STEIN, AND J. WEIN. 1994. Improved Approximation Algorithms for Shop Scheduling Problems. SIAM J. Comput. 23, 617-632.
18. VAESSENS, R. J. M., E. H. L. AARTS, AND J. K. LENSTRA. 1996. Job Shop Scheduling by Local Search. INFORMS J. Comput. 8, 302-317.
19. VAN LAARHOVEN, P. J. M., E. H. L. AARTS, AND J. K. LENSTRA. 1992. Job Shop Scheduling by Simulated Annealing. Opns. Res. 40, 113-125.