Abstract
We describe a fast sequential tabu search algorithm for the job shop scheduling problem. The algorithm uses an efficient way to recompute the path lengths in the graph representation after a step to a neighbouring solution. For a parallel algorithm, that consists of independent runs of the sequential algorithm, we give a probabilistic analysis of the possible speed-up.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E.H.L. Aarts, P.J.M. van Laarhoven, J.K. Lenstra, and N.J.L. Ulder. A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing, 6:118–125, 1995.
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, Pennsylvania, 1994.
H.A. David. Order Statistics. Wiley, 1970.
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. Prentice Hall, Englewood Cliffs, 1963.
I.T. Foster. Designing and Building Parallel Programs. Addison-Wesley, 1995.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S.C. Graves, A.H.G. Rinnooy Kan, and P. Zipkin, editors, Handbooks in Operations Research and Management Science 4. North-Holland, 1993.
S. Lawrence. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement). Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1984.
H. Matsuo, C.J. Suh, and R.S. Sullivan. A controlled search simulated annealing method for the general job shop scheduling problem. Working Paper 03-04-88, Graduate School of Business, The University of Texas at Austin, 1988.
E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job shop problem. Management Science, 42:797–813, 1996.
B. Roy and B. Sussmann. Les problèmes d’ordonnancement avec constraints disjonctives. Note DS 9 bis, SEMA, Paris, France, 1964.
E. Taillard. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6:108–117, 1994.
R.J.M. Vaessens. Generalized Job Shop Scheduling: Complexity and Local Search. PhD thesis, Eindhoven University, 1995.
P.J.M. van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job shop scheduling by simulated annealing. Operations Research, 40:113–125, 1992.
M.G.A. Verhoeven and E.H.L. Aarts. Parallel local search and job shop scheduling. In A. Ferreira and J.D.P. Rolim, editors, Parallel Algorithms for Irregular Problems: State ot the Art. Kluwer, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
ten Eikelder, H.M.M., Aarts, B.J.M., Verhoeven, M.G.A., Aarts, E.H.L. (1999). Sequential and Parallel Local Search Algorithms for Job Shop Scheduling. In: Voß, S., Martello, S., Osman, I.H., Roucairol, C. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5775-3_25
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5775-3_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7646-0
Online ISBN: 978-1-4615-5775-3
eBook Packages: Springer Book Archive