Abstract
Although tabu search is one of the most effective meta-heuristics for solving the job-shop scheduling problem (JSP), very little is known about why this approach works so well and under what conditions it excels. Our goal is to develop models of tabu search algorithms for the JSP that answer these and other related research questions. We have previously demonstrated that the mean distance between random local optima and the nearest optimal solution, denoted \(\bar d_{lopt - opt} \) , is highly correlated with problem difficulty for a well-known tabu search algorithm for the JSP introduced by Taillard. In this paper, we discuss various shortcomings of the \(\bar d_{lopt - opt} \) model and develop new models of problem difficulty that correct these deficiencies. We show that Taillard's algorithm can be modelled with exceptionally high fidelity using a surprisingly simple Markov chain. The Markov model also enables us to characterise the exact conditions under which different initialisation methods can be expected to improve performance. Finally, we analyse the relationship between the Markov and \(\bar d_{lopt - opt} \)> models.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beck, J. C. and Fox, M. S. (2000) Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence, 117:31–81.
Blażewicz, J., Domschke, W. and Pesch, E. (1996) The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93:1–33.
Chambers, J. B. and Barnes, J. W. (1996) New tabu search results for the job shop scheduling problem. Technical Report ORP96-10, Graduate Programme in Operations Research and Industrial Engineering, The University of Texas at Austin.
Giffler, B. and Thompson, G. L. (1960) Algorithms for solving production scheduling problems. Operations Research, 8:487–503.
Jain, A. S. and Meeran, S. (1999) Deterministic job-shop scheduling: Past, present, and future. European Journal of Operational Research, 113:390–434.
Jain, A. S., Rangaswamy, B. and Meeran, S. (2000) New and “stronger” job-shop neighborhoods: A focus on the method of Nowicki and Smutnicki (1996) Journal of Heuristics, 6:457–480.
Mattfeld, D. C. (1996) Evolutionary Search and the Job Shop. Physica-Verlag, Heidelberg.
Mattfeld, D. C., Bierwirth, C. and Kopfer, H. (1999) A search space analysis of the job shop scheduling problem. Annals of Operations Research, 86:441–453.
Nowicki, E. and Smutnicki, C. (1996) A fast taboo search algorithm for the job shop problem. Management Science, 42:797–813.
Singer, J., Gent, I. P. and Smaill, A. (2000) Backbone fragility and the local search cost peak. Journal of Artificial Intelligence Research, 12:235–270.
Taillard, É. D. (1989) Parallel taboo search technique for the jobshop scheduling problem. Technical Report ORWP 89/11, DMA, Ecole Polytechnique Fédérale de Lausanne, Switzerland.
Taillard, É. D. (1994) Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6:108–117.
van Laarhoven, P. J. M, Aarts, E. H. L. and Lenstra, J. K. (1992) Job shop scheduling by simulated annealing. Operations Research, 40:113–125.
Watson, J. P. (2003) Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. Ph.D. Thesis, Department of Computer Science, Colorado State University.
Watson, J. P., Beck, J. C., Howe, A. E. and Whitley, L. D. (2003) Problem difficulty for tabu search in job-shop scheduling. Artificial Intelligence, 143:187–217.
Werner, F. and Winkler, A. (1995) Insertion techniques for the heuristic solution of the job shop problem. Discrete Applied Mathematics, 58:191–211.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Watson, JP., Whitley, L.D., Howe, A.E. (2005). A Dynamic Model of Tabu Search for the Job-Shop Scheduling Problem. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds) Multidisciplinary Scheduling: Theory and Applications. Springer, Boston, MA. https://doi.org/10.1007/0-387-27744-7_12
Download citation
DOI: https://doi.org/10.1007/0-387-27744-7_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25266-7
Online ISBN: 978-0-387-27744-8
eBook Packages: Business and EconomicsBusiness and Management (R0)