Constraint programming: an efficient and practical approach to solving the job-shop problem

  • Yves Colombani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1118)


Recent improvements in constraint programming have made it possible to tackle hard problems in a practical way. Before this, these problems were solved only by specialized programs often complex to implement. Scheduling problems and more especially the job-shop problem belong to this class. In this paper we explain a relatively simple constraint system, which enables us to solve 10 × 10 problems efficiently. The method described here, based on evaluations which come as close as possible to release and due dates of jobs to be scheduled, requires no prior knowledge of the problem being processed, in particular, no bounds over optimum value (consequently no specific algorithm to find approximate solutions). We also comment on the results of experiments on known problems. As far as we know, the system outlined here is the only one that, using just constraint solving and an exhaustive enumeration strategy, can completely solve orb3[AC91] in less than half an hour computational time.


Job-Shop Scheduling Constraint Programming Efficiency 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AB92]
    A. Aggoun and N. Beldiceanu. Extending CHIP in Order To Solve Complex Scheduling and Placement Problems. In Journées Francophones de Programmation Logique, 1992.Google Scholar
  2. [AC91]
    David Applegate and William Cook. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing, 3(2): 149–156, 1991.Google Scholar
  3. [BLPN95]
    Philippe Baptiste, Claude Le Pape, and Win Nuijten. Constraint-Based Optimisation and Approximation for Job-Shop Scheduling. In Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manifacturing Systems, IJCAI-95, 1995.Google Scholar
  4. [BOV94]
    Frédéric Benhamou, William J. Older, and André Vellino. Constraint Logic Programming on Boolean, Integer and Real Intervals. Accepted for publication in Journal of Symbolic Computation, 1994.Google Scholar
  5. [CL94]
    Yves Caseau and François Laburthe. Improved CLP Scheduling with Task Intervals. In International Conference on Logic Programming, 1994.Google Scholar
  6. [CL95]
    Yves Caseau and François Laburthe. Disjunctive Scheduling with Task Intervals. Technical Report 95-25, LIENS, 1995.Google Scholar
  7. [Col96]
    Yves Colombani. Stratégies d'énumération pour le problème du job-shop. Technical Report 141, LIM, 1996.Google Scholar
  8. [CP89]
    Jacques Carlier and Éric Pinson. An Algorithm for Solving the Job-Shop Problem. Management Science, 35(2):164–176, 1989.Google Scholar
  9. [CP94]
    Jacques Carlier and Éric Pinson. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78:146–161, 1994.Google Scholar
  10. [Mac77]
    A.K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99–118, 1977.Google Scholar
  11. [MT63]
    J.F. Muth and G.L. Thompson. Industrial scheduling. Prentice Hall, 1963.Google Scholar
  12. [VH89]
    Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Yves Colombani
    • 1
  1. 1.Faculté des sciences de LuminyLaboratoire d'Informatique de Marseille - URA CNRS 1787Marseille Cedex 9France

Personalised recommendations