Abstract
Hybrid search methods synthesize desirable aspects of both constructive and local search methods. Constructive methods are systematic and complete, but exhibit poor performance on large problems because bad decisions made early in the search persist for exponentially long times. In contrast, stochastic local search methods are immune to the tyranny of early mistakes. Local search methods replace systematicity with stochastic techniques for diversifying the search. However, the lack of systematicity makes remembering the history of past states problematic. Typically, hybrid methods introduce a stochastic element into a basically constructive search framework. Lynce [6] uses randomized backtracking in a complete boolean satisfiability solver which incorporates clause (nogood) learning to ensure completeness. Jussein & Lhomme [4] perform a constructive search while keeping conflict sets (nogoods) in a Tabu list and backtrack via a stochastic local search in the space of conflict sets.
Our method, called Systematic Local Search (SysLS) [3], follows the opposite approach. We incorporate systematicity within an inherently stochastic search method (like [2]). SysLS searches through a space of complete variable assignments and relaxes the requirement for maintaining feasibility. It preserves full freedom to move heuristically in the search space with maximum heuristic information available. While many local search methods easily get trapped in local optima, SysLS records local optima as nogoods in a search memory. Nogoods force the search away from these maximally consistent but unacceptable solutions. Our method is analogous to other diversification mechanisms in local search (eg-Tabu search) but is systematic and inherits the sound resolution rule for nogood learning. In this paper, we extend SysLS for optimization and, in particular, for job shop scheduling problems.
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
Geyik, F., Cedimoglu, I.H.: The strategies and parameters of tabu search for job-shop scheduling. Journal of Intelligent Manufacturing 15(4), 439–448 (2004)
Ginsberg, M.L., McAllester, D.A.: GSAT and Dynamic Backtracking. In: Torasso, P., Doyle, J., Sandewall, E. (eds.) The 4th International Conference on Principles of Knowledge Representation and Reasoning, pp. 226–237. Morgan Kaufmann, San Francisco (1994)
Havens, W.S., Dilkina, B.N.: A Hybrid Schema for Systematic Local Search. In: Canadian Conference on Artifical Intelligence (2004)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139(1), 21–45 (2002)
Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job Shop Scheduling by Simulated Annealing. Operations Research 50(1), 113–125 (1992)
Lynce, I., Marques-Silva, J.: Complete unrestricted backtracking algorithms for satisfiability. In: The 5th International Symposium on the Theory and Applications of Satisfiability Testing (2002)
Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science 42(6), 797–813 (1996)
Pezzella, F., Merelli, E.: A tabu search method guided by shifting bottleneck for the job shop scheduling problem. European Journal of Operational Research 120, 297–310 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dilkina, B., Duan, L., Havens, W.S. (2005). Extending Systematic Local Search for Job Shop Scheduling Problems. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_60
Download citation
DOI: https://doi.org/10.1007/11564751_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)