A new approach to computing optimal schedules for the job-shop scheduling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 389-403

  Martin, Paul ^a   Shmoys, David B ^a  

^a Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; SCHEDULING;

BOUNDING PROCEDURES; DISJUNCTIVE GRAPHS; JOB SHOP SCHEDULING PROBLEMS; LOWER BOUNDS; NEW APPROACHES; OPTIMAL SCHEDULE; OPTIMALITY; OPTIMIZATION PROBLEMS;

JOB SHOP SCHEDULING;

EID: 84947927805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_29     Document Type: Conference Paper

References (22)

1. J. Adams, E. Balas, and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management Set., 34:391-401, 1988.
2. D. Applegate and W. Cook. A computational study of the job-shop scheduling problem. ORSA J. Comput., 3:149-156, 1991.
3. E. Balas. On the facial structure of scheduling polyhedra. Math. Programming Stud., 24:179-218, 1985.
4. E. Balas and A. Vazacopoulos. Guided Local Search with Shifting Bottleneck for Job Shop Scheduling. Management Science Research Report #MSRR-609, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1994.
5. P. Bratley, M. Florian, and P. Robillard. On sequencing with earliest starts and due dates with application to computing bounds for the problem. Naval Res. Logist. Quart., 20:57-67, 1973.
6. P. Brucker, B. Jurisch, and B. Sievers. A branch and bound algorithm for the job-shop scheduling problem. Discrete Appl. Math., 49:107-127, 1994.
7. J. Carlier and E. Pinson. An algorithm for solving the job-shop problem. Management Sc., 35:164-176, 1989.
8. J. Carlier and E. Pinson. A practical use of Jackson's preemptive schedule for solving the job-shop problem. Ann. Oper. Res., 26:269-287, 1990.
9. J. Carlier and E. Pinson. Adjustments of heads and tails for the job-shop problem. European J. Oper. Res., 78:146-161, 1994.
10. H. Fisher and G.L. Thompson. Probabilistic learning combinations of local job-shop scheduling rules. In J.F. Muth and G.L. Thompson, editors, Industrial Scheduling, pages 225-251. Prentice Hall, Englewood Cliffs, NJ, 1963.
11. M.L. Fisher, B.J. Lageweg, J.K. Lenstra, and A.H.G. Rinnooy Kan. Surrogate duality relaxation for job shop scheduling. Discrete Appl. Math., 5:65-75, 1983.
12. M.R. Garey, D.S. Johnson, and R. Sethi. The complexity of flowshop and jobshop scheduling. Math. Oper. Res., 1:117-129, 1976.
13. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling. Ann. Discrete Math., 5:287-326, 1979.
14. J.R. Jackson. An extension of Johnson's results on job lot scheduling. Naval Res. Logist. Quart., 3:201-203, 1956.
15. S. Lawrence. Resource Constrained Project Scheduling: an Experimental Investigation of Heuristic Scheduling Techniques (Supplement). Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1984.
16. E. Nowicki and C. Smutnicki. A fast taboo search algoritm for the job shop problem. Management Sci. To appear.
17. S. A. Plotkin, D. B. Shmoys, and É. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res., 20:257-301, 1995.
18. D.B. Shmoys. Solving scheduling problems via linear programming. Talk at ORSA/TIMS, Boston, MA, May 1994.
19. J.P. Sousa and L.A. Wolsey. A time-indexed formulation of non-preemptive singlemachine scheduling problems. Math. Programming, 54:353-367, 1992.
20. C. Stein. Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems. PhD thesis, MIT/LCS/TR-550, Laboratory for Computer Science, MIT, Cambridge, MA, 1992.
21. R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. Job shop scheduling by local search. Math. Programming B. To appear.
22. J.M. Van den Akker. LP-based solution methods for single-machine scheduling problems. PhD thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994.