Abstract
In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we parallelize the search on shared-memory computers. Third, we add an object-oriented extensible control language to implement complex complete and incomplete search procedures. The result is a powerful set of tools which offers both brute force search using simple search procedures and parallelism, and finely tuned search procedures using that expressive control language. With this, we were able both to solve difficult and open problems using complete search procedures, and to quickly produce good results using incomplete search procedures.
This research is partially funded by the Commission of the European Union contract ESPRIT 24960. The author is solely responsible for the content of the document.
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.
Similar content being viewed by others
References
Aarts, E.H.L., van Laarhoven, P.J.M., Lenstra, J.K., Ulder, N.J.L.: A computational study of local search algorithms for job shop scheduling. 6, 113–125 (1994)
Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA Journal on Computing 3(2), 149–156 (1991)
Barnes, J.W., Chambers, J.B.: Solving the job shop scheduling problem using tabu search. IEE Transactions 27/2, 257–263 (1994)
Clocksin, W.: Principles of the DelPhi parallel inference machine. Computer Journal 30(5), 386–392 (1987)
Dell’Amico, M., Trubian, M.: Appplying tabu-search to the job-shop scheduling problem. Annals of Operational Research 41, 231–252 (1993)
Dorndorf, U., Pesch, E.: Evolution based learning in a job shop scheduling environment. Computers and Operations Research 22, 25–40 (1995)
Thompson, G.L., Fisher, H.: Probabilistic learning combinations of local job-shop scheduling rules. In: Thompson, G.L., Muth, J.F. (eds.) Industrial Scheduling, pp. 225–251. Prentice Hall, Englewood Cliffs (1963)
Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceeding of IJCAI, vol. 1, pp. 607–613 (August 1995)
Balas, E., Adams, J., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science 34, 391–401 (1988)
Laburthe, F., Caseau, Y.: Salsa: A language for search algorithms. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 310–325. Springer, Heidelberg (1998)
Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Carnegie-Mellon University, Pennsylvania (1984) (supplement)
Meseguer, P.: Interleaved depth-first search. International Joint Conference on Artificial Intelligence 2, 1382–1387 (1997)
Michel, L., Van Hentenryck, P.: Localizer: A modelling language for local search. In: CP 1997. LNCS, vol. 1330. Springer, Heidelberg (1997)
Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science 42(6), 797–813 (1996)
Nuijten, W., Le Pape, C.: Constraint-based job shop scheduling with ilog scheduler. Journal of Heuristics 3, 271–286 (1998)
Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1984)
Perron, L.: An implementation of or-parallelism based on direct access to the MMU. In: Proc. of Compulog-Net worshop on parallelism and implementation technology, JICSLP 1996 (1996)
Pesant, G., Gendreau, M.: A view of local search in constraint programming. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 353–366. Springer, Heidelberg (1996)
Schulte, C.: Oz Explorer: A visual constraint programming tool. In: Naish, L. (ed.) Proceedings of the Fourteenth International Conference on Logic Programming, Leuven, Belgium, pp. 286–300. The MIT Press, Cambridge (1997)
Walsh, T.: Depth-bounded discrepancy search. In: International Joint Conference on Artificial Intelligence, vol. 2, pp. 1388–1393 (August 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perron, L. (1999). Search Procedures and Parallelism in Constraint Programming. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive