Abstract
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search approaches for these problems has focused on developing problem specific constraint propagators and ordering heuristics. Indeed, the common belief is that many of these problems are too difficult to solve without such domain specific models. We introduce a simple constraint model that combines a generic adaptive heuristic with naive propagation, and show that it often outperforms state-of-the-art solvers for both open shop and job shop problems.
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
Malapert, A., Cambazard, H., Guéret, C., Jussien, N., Langevin, A., Rousseau, L.-M.: An Optimal Constraint Programming Approach to the Open-Shop problem. Submitted to INFORMS, Journal of Computing (2008)
Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming Techniques to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)
Beck, J.C., Davenport, A.J., Sitarski, E.M., Fox, M.S.: Texture-Based Heuristics for Scheduling Revisited. In: AAAI/IAAI, pp. 241–248 (1997)
Christopher Beck, J.: Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling. Journal of Artificial Intelligence Research 29, 49–77 (2007)
Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004), Valencia, Spain, August 2004, pp. 482–486 (2004)
Brucker, P., Hurink, J., Jurisch, B., Wöstmann, B.: A Branch & Bound Algorithm for the Open-shop Problem. In: GO-II Meeting: Proceedings of the Second International Colloquium on Graphs and Optimization, pp. 43–59. Elsevier Science Publishers B. V., Amsterdam (1997)
Carlier, J., Pinson, E.: An Algorithm for Solving the Job-shop Problem. Management Science 35(2), 164–176 (1989)
The choco team. choco: an Open Source Java Constraint Programming Library. In: The Third International CSP Solver Competition, pp. 31–40 (2008)
Fox, M.S., Sadeh, N.M., Baykan, C.A.: Constrained heuristic search. In: IJCAI, pp. 309–315 (1989)
Guéret, C., Prins, C.: A new Lower Bound for the Open Shop Problem. Annals of Operations Research 92, 165–183 (1999)
Hebrard, E.: Mistral, a Constraint Satisfaction Library. In: The Third International CSP Solver Competition, pp. 31–40 (2008)
Laborie, P.: Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and new Results. Artificial Intelligence 143(2), 151–188 (2003)
Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood Recording from Restarts. In: IJCAI, pp. 131–136 (2007)
Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. In: ISTCS, pp. 128–133 (1993)
Meiri, I.: Combining Qualitative and Quantitative Constraints in Temporal Reasoning. In: AAAI, pp. 260–267 (1991)
Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem. Manage. Sci. 42(6), 797–813 (1996)
Nowicki, E., Smutnicki, C.: An Advanced Tabu Search Algorithm for the Job Shop Problem. Journal of Scheduling 8(2), 145–159 (2005)
Nuijten, W.: Time and Resource Constraint Scheduling: A Constraint Satisfaction Approach. PhD thesis, Eindhoven University of Technology (1994)
Le Pape, C.: Implementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems. Intelligent Systems Engineering 3, 55–66 (1994)
Sha, D.Y., Hsu, C.-Y.: A new Particle Swarm Optimization for the Open Shop Scheduling Problem. Computers & Operation Research 35(10), 3243–3261 (2008)
Taillard, E.: Benchmarks for Basic Scheduling Problems. European Journal of Operations Research 64, 278–285 (1993)
Walsh, T.: Search in a Small World. In: IJCAI, pp. 1172–1177 (1999)
Watson, J.-P., Beck, J.C.: A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 263–277. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grimes, D., Hebrard, E., Malapert, A. (2009). Closing the Open Shop: Contradicting Conventional Wisdom. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)