Skip to main content
SpringerLink
Log in

Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

In the recent years, constraint programming has been applied to a wide variety of academic and industrial non-preemptive scheduling problems, i.e., problems in which activities cannot be interrupted. In comparison, preemptive scheduling problems have received almost no attention from both the Operations Research and the Artificial Intelligence community. Motivated by the needs of a specific application, we engaged in a study of the applicability of constraint programming techniques to preemptive scheduling problems. This paper presents the algorithms we developed and the results we obtained on the preemptive variant of the famous “job-shop scheduling problem.” Ten heuristic search strategies, combined with two different constraint propagation techniques, are presented, and compared using two well-known series of job-shop scheduling instances from the literature. The best combination, which relies on “limited discrepancy search” and on “edge-finding” techniques, is shown to provide excellent solutions to the preemptive job-shop scheduling problem. A mean relative distance to the optimal solution of 0.32% is achieved in five minutes, on instances with 10 jobs and 10 machines (100 activities).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adams, J., E. Balas, and D. Zawack. (1988). “The Shifting Bottleneck Procedure for Job-Shop Scheduling,” Management Science 34, 391–401.

    Google Scholar 

  • Aggoun, A. and N. Beldiceanu. (1993). “Extending CHIP in Order to Solve Complex Scheduling and Placement Problems,” Mathematical and Computer Modelling 17, 57–73.

    Google Scholar 

  • Applegate, D. and W. Cook. (1991). “AComputational Study of the Job-Shop Scheduling Problem,” ORSA Journal on Computing 3, 149–156.

    Google Scholar 

  • Baptiste, Ph. and C. Le Pape. (1995). “A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling.” Proc. 14th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 600–606.

  • Baptiste, Ph., C. Le Pape, and W.P.M. Nuijten. (1995). “Constraint-Based Optimization and Approximation for Job-Shop Scheduling.” Proc. AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, pp. 5–16.

  • Baptiste, Ph. and C. Le Pape. (1997). “Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems.” Proc. 3rd International Conference on Principles and Practice of Constraint Programming. Springer-Verlag, pp. 375–389.

  • Beck, H. (1992). “Constraint Monitoring in TOSCA.” Proc. AAAI Spring Symposium on Practical Approaches to Planning and Scheduling.

  • Beck, J.C., A.J. Davenport, E.M. Sitarski, and M.S. Fox. (1997). “Texture-Based Heuristics for Scheduling Revisited.” Proc. 14th National Conference on Artificial Intelligence. MIT Press.

  • Brucker, P., B. Jurisch, and B. Sievers. (1994). “A Branch and Bound Algorithm for the Job-Shop Scheduling Problem,” Discrete Applied Mathematics 49, 107–127.

    Google Scholar 

  • Brucker, P. and O. Thiele. (1996). “A Branch and Bound Method for the General-Shop Problem with Sequence-Dependent Setup Times,” OR Spektrum 18, 145–161.

    Google Scholar 

  • Brucker, P., S. Knust, A. Schoo, and O. Thiele. (1997). “A Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem.” Working Paper, University of Osnabrück, Germany.

  • Burke, P. (1989). “Scheduling in Dynamic Environments.” Ph.D. thesis, University of Strathclyde, Glasgow, United Kingdom.

    Google Scholar 

  • Burke, P. and P. Prosser. (1991). “A Distributed Asynchronous System for Predictive and Reactive Scheduling,”International Journal for Artificial Intelligence in Engineering 6, 106–124.

    Google Scholar 

  • Carlier, J. and E. Pinson. (1990). “A Practical Use of Jackson's Preemptive Schedule for Solving the Job-Shop Problem,” Annals of Operations Research 26, 269–287.

    Google Scholar 

  • Carlier, J. and E. Pinson. (1994). “Adjustment of Heads and Tails for the Job-Shop Problem,” European Journal of Operational Research 78, 146–161.

    Google Scholar 

  • Caseau, Y. and F. Laburthe. (1994). “Improved CLP Scheduling with Task Intervals.” Proc. 11th International Conference on Logic Programming. MIT Press.

  • Caseau, Y. and F. Laburthe. (1995). “Disjunctive Scheduling with Task Intervals.” Technical Report, Ecole Normale Supérieure, Paris, France.

  • Caseau, Y. and F. Laburthe. (1996a). “Cumulative Scheduling with Task Intervals.” Proc. Joint International Conference and Symposium on Logic Programming.

  • Caseau, Y. and F. Laburthe. (1996b). “CLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving,” Working Paper, Bouygues, Direction Scientifique, Saint-Quentin-en-Yvelines, France.

  • Cesta, A. and A. Oddi. (1996). “Gaining Efficiency and Flexibility in the Simple Temporal Problem.” Proc. 3rd International Workshop on Temporal Representation and Reasoning, pp. 45–50.

  • Cheng, C.-C. and S.F. Smith. (1994). “Generating Feasible Schedules under Complex Metric Constraints.” Proc. 12th National Conference on Artificial Intelligence. MIT Press, pp. 1086–1091.

  • Cheng, C.-C. and S.F. Smith. (1995a). “Applying Constraint Satisfaction Techniques to Job-Shop Scheduling.” Technical Report, Carnegie Mellon University, Pittsburgh, Pennsylvania.

  • Cheng, C.-C. and S.F. Smith. (1995b). “A Constraint-Posting Framework for Scheduling under Complex Constraints.”Proc. AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, pp. 64–75.

  • Collinot, A. and C. Le Pape. (1987). “Controlling Constraint Propagation.” Proc. 10th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 1032–1034.

  • Colombani, Y. (1996). “Constraint Programming: An Efficient and Practical Approach to Solving the Job-Shop Problem.” Proc. 2nd International Conference on Principles and Practice of Constraint Programming. Springer-Verlag, pp. 149–163.

  • Colombani, Y. (1997). “Un modéele de résolution de contraintes adapté aux problémes d'ordonnancement.” Ph.D. thesis, Université de la Méditerranée, Aix-Marseille II, France (in French).

    Google Scholar 

  • Demeulemeester, E. (1992). “Optimal Algorithms for Various Classes of Multiple Resource-Constrained Project Scheduling Problems.” Ph.D. thesis, Katholieke Universiteit Leuven, Leuven, Belgium.

    Google Scholar 

  • Erschler, J., F. Roubellat, and J.-P. Vernhes. (1976). “Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem,” Operations Research 24, 774–783.

    Google Scholar 

  • Erschler, J., P. Lopez, and C. Thuriot. (1991). “Raisonnement temporel sous contraintes de ressource et problémes d'ordonnancement,” Revue d'Intelligence Artificielle 5, 7–32 (in French).

    Google Scholar 

  • Fox, M.S. (1983). “Constraint-Directed Search: A Case Study of Job-Shop Scheduling.” Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, Pennsylvania.

    Google Scholar 

  • Fox, M.S. and S.F. Smith. (1984). “ISIS: A Knowledge-Based System for Factory Scheduling,” Expert Systems 1, 25–49.

    Google Scholar 

  • Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company.

  • Gondran, M. and M. Minoux. (1984). Graphs and Algorithms. John Wiley and Sons.

  • Harvey, W.D. and M.L. Ginsberg. (1995). “Limited Discrepancy Search.” Proc. 14th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 607–613.

  • Korf, R.E. (1996). “Improved Limited Discrepancy Search.” Proc. 13th National Conference on Artificial Intelligence. MIT Press, pp. 286–291.

  • Le Pape, C. and.F. Smith. (1987). “Management of Temporal Constraints for Factory Scheduling.” Proc. IFIP TC 8/WG 8.1 Working Conference on Temporal Aspects in Information Systems. North-Holland, pp. 159–170.

  • Le Pape, C. (1988). “Des systémes d'ordonnancement flexibles et opportunistes.” Ph.D. thesis, University Paris XI, Orsay, France (in French).

    Google Scholar 

  • Le Pape, C. (1991). “Constraint Propagation in Planning and Scheduling.” Technical Report, Stanford University, Palo Alto, California.

  • Le Pape, C. (1994). “Implementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems,” Intelligent Systems Engineering 3, 55–66.

    Google Scholar 

  • Le Pape, C. and Ph. Baptiste. (1996). “Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case.” Proc. 12th European Conference on Artificial Intelligence. John Wiley and Sons, pp. 619–623.

  • Le Pape, C. and Ph. Baptiste. (1997a). “An Experimental Comparison of Constraint-Based Algorithms for the Preemptive Job-Shop Scheduling Problem.” Proc. CP Workshop on Industrial Constraint-Directed Scheduling.

  • Le Pape, C. and Ph. Baptiste. (1997b). “A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling.” Proc. 3rd International Conference and Exhibition on the Practical Application of Constraint Technology. The Practical Application Company, pp. 237–256.

  • Le Pape, C. and Ph. Baptiste. (1998). “Resource Constraints for Preemptive Job-Shop Scheduling,” Constraints 3, 263–287.

    Google Scholar 

  • Lock, H.C.R. (1996). “An Implementation of the Cumulative Constraint.”Working Paper, University of Karlsruhe, Karlsruhe, Germany.

  • Lopez, P. (1991). “Approche énergétique pour l'ordonnancement de tOaches sous contraintes de temps et de ressources.” Ph.D. thesis, Université Paul Sabatier, Toulouse, France (in French).

    Google Scholar 

  • Martin, P. and D.B. Shmoys. (1996). “A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem.” Proc. 5th International Conference on Integer Programming and Combinatorial Optimization.

  • Mattfeld, D.C. (1996). Evolutionary Search and the Job-Shop: Investigations on Genetic Algorithms for Production Scheduling. Physica-Verlag.

  • Nowicki, E. and C. Smutnicki. (1996). “A Fast Taboo Search Algorithm for the Job-Shop Problem,” Management Science 42, 797–813.

    Google Scholar 

  • Nuijten, W.P.M. and E.H.L. Aarts. (1994). “Constraint Satisfaction for Multiple Capacitated Job-Shop Scheduling.” Proc. 11th European Conference on Artificial Intelligence. John Wiley and Sons, pp. 635–639.

  • Nuijten, W.P.M. (1994). “Time and Resource Constrained Scheduling: AConstraint Satisfaction Approach.” Ph.D. thesis, Pindhoven University of Technology, Eindhoven, The Netherlands.

    Google Scholar 

  • Nuijten, W.P.M. and E.H.L. Aarts. (1996). “A Computational Study of Constraint Satisfaction for Multiple Capacitated Job-Shop Scheduling,” European Journal of Operational Research 90, 269–284.

    Google Scholar 

  • Péridy, L. (1996). “Le probléme de job-shop: arbitrages et ajustements.” Ph.D. thesis, Université de Technologie de Compiégne, Compiégne, France (in French).

    Google Scholar 

  • Pinson, E. (1988). “Le probléme de job-shop.” Ph.D. thesis, University Paris VI, Paris, France (in French).

    Google Scholar 

  • Prosser, P. (1990). “Distributed Asynchronous Scheduling.” Ph.D. thesis, University of Strathclyde, Glasgow, United Kingdom.

    Google Scholar 

  • Rit, J.-F. (1986). “Propagating Temporal Constraints for Scheduling.” Proc. 5th National Conference on Artificial Intelligence. MIT Press, pp. 383–388.

  • Smith, S.F., M.S. Fox, and P.S. Ow. (1986). “Constructing and Maintaining Detailed Production Plans: Investigations into the Development of Knowledge-Based Factory Scheduling Systems,” AI Magazine 7, 45–61.

    Google Scholar 

  • Smith, S.F. (1992). “Knowledge-Based Production Management: Approaches, Results and Prospects,” Production Planning and Control 3, 350–380.

    Google Scholar 

  • Steele, G.L. Jr. (1980). “The Definition and Implementation of a Computer Programming Language Based on Constraints.” Ph.D. thesis, Massachusetts Institute of Technology.

  • Vaessens, R.J.M., E.H.L. Aarts, and J.K. Lenstra. (1994). “Job-Shop Scheduling by Local Search.” COSOR Memorandum 94-05, Eindhoven University of Technology, Eindhoven, The Netherlands.

    Google Scholar 

  • Varnier, C., P. Baptiste, and B. Legeard. (1993). “Le traitement des contraintes disjonctives dans un probléme d'ordonnancement: exemple du Hoist Scheduling Problem.” Proc. 2émes journées francophones de programmation logique. (in French), pp. 343–363.

  • Walsh, T. (1997). “Depth-bounded Discrepancy Search.” Proc. 15th International Joint Conference on Artificial Intelligence. Morgan Kaufmann.

  • Zweben, M. and M. Fox. (eds.). (1994). Intelligent Scheduling. Morgan Kaufmann.

Download references

Author information

Authors and Affiliations

  1. Bouygues, Direction des Technologies Nouvelles, 1, av. E. Freyssinet, F-78061, Saint-Quentin-en-Yvelines

    Claude Le Pape

  2. Université de Technologie de Compiègne, UMR CNRS 6599 HEUDIASYC

    Philippe Baptiste

Authors
  1. Claude Le Pape
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Baptiste
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pape, C.L., Baptiste, P. Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem. Journal of Heuristics 5, 305–325 (1999). https://doi.org/10.1023/A:1009613717770

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009613717770

Search

Navigation