Abstract
Constraint logic programming has been applied to cost minimization problems such as job-shop scheduling with some success, using the (depth-first) branch and bound method. Recent work has shown that problem-specific heuristics can improve the performance of CLP systems on combinatorial optimisation problems. In this paper we take an orthogonal approach, by developing a generic parallel branch and bound strategy which improves existing CLP strategies in several ways: by avoiding the sometimes prohibitive overheads common to existing implementations; by speeding up convergence to optimal solutions; and by speeding up the proof of optimality for suboptimal solutions. The latter two improvements exploit parallelism in novel ways, which can be smoothly integrated with Or-parallelism. We evaluate these ideas on a set of job-shop scheduling problems, in some cases achieving order of magnitude speedups.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. In Proc. of JFPL'92, 1992.
J. Carlier and E. Pinson. An algorithm for solving the job shop problem. Management Science, 35(2), 2 1989.
Yves Caseau and Francois Laburthe. Improved CLP scheduling with task intervals. In Proc. of Eleventh International Conference on Logic Programming, pages 369–383. The MIT Press, 1994.
D. Clark, C. Rawlings, J. Shirazi, Liang liang Li, Mike Reeve, Kees Schuermann, and Andre Veron. Solving large combinatorial problems in molecular biology using the ElipSys parallel constraint logic programming system. Computer Journal, 36(4), 1993.
Jean-Yves Cras. A review of industrial constraint solving tools, survey, AI Perspectives, 1994.
Claude G. Diderich and Marc Gengler. A survey of minimax trees and associated algorithms. Technical Report 94/50, Swiss Federal Institute of Technology, Lausanne, 1994.
M. Dincbas et al. The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88), pages 693–702. ICOT, 1988.
European Computer-Industry Research Centre, Munich, Germany. ECLiPSe 3.5.1 User Manual, 1995.
Pascal Van Hentenryck. Personal communication, January 1995.
V. Kumar and V.N. Rao. Parallel depth first search — Part I. Implementation. International Journal of Parallel Programming, 16(6), 1987.
V. Kumar and V.N. Rao. Parallel depth first search — Part II. Analysis. International Journal of Parallel Programming, 16(6), 1987.
Ewing Lusk, Ralph Butler, Terence Disz, Robert Oison, Ross Overbeek, Rick Stevens, D.H.D Warren, Alan Calderwood, Peter Szerdi, Seif Haridi, Per Brand, Mats Carlsson, Andrzej Ciepielewski, and Bogumil Hausman. The Aurora Or-Parallel Prolog system. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88). ICOT, 1988.
J. F. Muth and G. L. Thompson. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, New Jersey, 1963.
Steven Prestwich and Shyam Mudambi. Cost-parallel branch and bound in CLP. In Proc. of ILPS 1994 post-conference workshop on Constraint Languages and Systems, pages 141–149, 1994. Available as an ECRC technical report no. 94-38.
T.J. Reynold and P. Kefalas. Or-parallel prolog and search problems in AI applications. In Logic Programming: Proceedings of the Seventh Internatinal Conference, pages 340–354. MIT Press, 1990.
Peter Szeredi. Exploiting or-parallelism in optimisation problems. In Proceedings of the JICSLP'92, pages 703–716. MIT Press, 1992.
P. Van Hentenryck. Parallel constraint satisfaction in logic programming: Preliminary results of chip within PEPSys. In Giorgio Levi and Maurizio Martelli, editors, Proceedings of the Sixth International Conference on Logic Programming, pages 165–180, Lisbon, 1989. The MIT Press.
A. Veron, K. Schuerman, M. Reeve, and L. Li. APPLAUSE: Applications using the ElipSys parallel CLP system. In Proceedings of the Tenth International Conference on Logic Programming. MIT Press, June 1993.
A. Veron, K. Schuerman, M. Reeve, and L. Li. Why and how in the ElipSys Or-Parallel CLP system. In PARLE'93: Parallel Architectures and Languages Europe, pages 291–302. Springer-Verlag, 1993.
M. Wallace. Constraints in planning, scheduling and placement problems. In Constraint Programming. Springer-Verlag, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prestwich, S., Mudambi, S. (1995). Improved branch and bound in constraint logic programming. In: Montanari, U., Rossi, F. (eds) Principles and Practice of Constraint Programming — CP '95. CP 1995. Lecture Notes in Computer Science, vol 976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60299-2_32
Download citation
DOI: https://doi.org/10.1007/3-540-60299-2_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60299-6
Online ISBN: 978-3-540-44788-7
eBook Packages: Springer Book Archive