Abstract
From a computational point of view, the job-shop scheduling problem is one of the most notoriously intractable NP-hard optimization problems. In spite of a great deal of substantive research, there are instances of even quite modest size for which it is beyond our current understanding to solve to optimality. We propose several new lower bounding procedures for this problem, and show how to incorporate them into a branch-and-bound procedure. Unlike almost all of the work done on this problem in the past thirty years, our enumerative procedure is not based on the disjunctive graph formulation, but is rather a time-oriented branching scheme. We show that our approach can solve most of the standard benchmark instances, and obtains the best known lower bounds on each.
Research supported in part by the NEC Research Institute and in part by NSF grant CCR-9307391.
Research supported in part by NSF grant CCR-9307391.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Adams, E. Balas, and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management Sci., 34:391–401, 1988.
D. Applegate and W. Cook. A computational study of the job-shop scheduling problem. ORSA J. Comput., 3:149–156, 1991.
E. Balas. On the facial structure of scheduling polyhedra. Math. Programming Stud., 24:179–218, 1985.
E. Balas and A. Vazacopouios. 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.
P. Bratley, M. Florian, and P. Robillard. On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/F max) problem. Naval Res. Logist. Quart., 20:57–67, 1973.
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.
J. Carlier and E. Pinson. An algorithm for solving the job-shop problem. Management Sci., 35:164–176, 1989.
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.
J. Carlier and E. Pinson. Adjustments of heads and tails for the job-shop problem. European J. Oper. Res., 78:146–161, 1994.
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.
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.
M.R. Garey, D.S. Johnson, and R. Sethi. The complexity of flowshop and jobshop scheduling. Math. Oper. Res., 1:117–129, 1976.
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.
J.R. Jackson. An extension of Johnson's results on job lot scheduling. Naval Res. Logist. Quart., 3:201–203, 1956.
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.
E. Nowicki and C. Smutnicki. A fast taboo search algoritm for the job shop problem. Management Sci. To appear.
S. A. Plotkin, D. B. Shmoys, and É. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res., 20:257–301, 1995.
D.B. Shmoys. Solving scheduling problems via linear programming. Talk at ORSA/TIMS, Boston, MA, May 1994.
J.P. Sousa and L.A. Wolsey. A time-indexed formulation of non-preemptive single-machine scheduling problems. Math. Programming, 54:353–367, 1992.
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.
R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. Job shop scheduling by local search. Math. Programming B. To appear.
J.M. Van den Akker. LP-based solution methods for single-machine scheduling problems. PhD thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, P., Shmoys, D.B. (1996). A new approach to computing optimal schedules for the job-shop scheduling problem. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 1996. Lecture Notes in Computer Science, vol 1084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61310-2_29
Download citation
DOI: https://doi.org/10.1007/3-540-61310-2_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61310-7
Online ISBN: 978-3-540-68453-4
eBook Packages: Springer Book Archive