Resource Constraints for Preemptive Job-shop Scheduling

This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techniques (based on timetables, on disjunctive constraints, and on edge-finding) to preemptive and “mixed” problems, i.e., problems in which some activities can be interrupted and some cannot. Another approach relies on incremental flow-based techniques. We theoretically compare these approaches and present an experimental comparison based on a branch and bound procedure for the preemptive variant of the job-shop scheduling problem. We show that both edge-finding and flow-based techniques allow the resolution of hard problem instances, including the preemptive variant of the famous FT10.

[1]  Patrick Prosser,et al.  A distributed asynchronous system for predictive and reactive scheduling , 1991, Artif. Intell. Eng..

[2]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[3]  Stephen F. Smith,et al.  Generating Feasible Schedules under Complex Metric Constraints , 1994, AAAI.

[4]  Stephen F. Smith.  Exploiting Temporal Knowledge to Organize Constraints , 1983 .

[5]  François Laburthe,et al.  Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation , 1995, Combinatorics and Computer Science.

[6]  Philippe Baptiste,et al.  Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems , 1997, Constraints.

[7]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[8]  Pascal Van Hentenryck.  Improved CLP Scheduling with Task Intervals , 1994 .

[9]  Claude Le Pape,et al.  Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .

[10]  Wpm Wim Nuijten,et al.  Time and resource constrained scheduling : a constraint satisfaction approach , 1994 .

[11]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[12]  Bruno Legeard,et al.  Le traitement des contraintes disjonctives dans un problème d'ordonnancement : exemple du «Hoist Scheduling Problem» , 1993, JFPL.

[13]  Stephen F. Smith,et al.  Knowledge-based production management approaches, results and prospects , 1992 .

[14]  Marie-Luce Levy.  Méthodes par décomposition temporelle et problèmes d'ordonnancement , 1996 .

[15]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[16]  Philippe Baptiste,et al.  A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling , 1995, IJCAI.

[17]  John W. Lloyd.  Beyond the Glass Box: Constraints as Objects , 1995 .

[18]  Claude Le Pape,et al.  Controlling Constraint Propagation , 1987, IJCAI.

[19]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[20]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[21]  François Laburthe,et al.  Cumulative Scheduling with Task Intervals , 1996, JICSLP.

[22]  Howard Beck.  Constraint monitoring in TOSCA , 1992 .

[23]  Jean-François Rit,et al.  Propagating Temporal Constraints for Scheduling , 1986, AAAI.

[24]  Stephen F. Smith,et al.  Applying constraint satisfaction techniques to job shop scheduling , 1997, Ann. Oper. Res..

[25]  J. Erschler,et al.  Raisonnement temporel sous contraintes de ressource et problèmes d'ordonnancement , 1991 .

[26]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .

[27]  François Laburthe,et al.  Disjunctive Scheduling with Task Intervals , 1995 .

[28]  Awi Federgruen,et al.  Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques , 1986 .

[29]  Peter Burke,et al.  Scheduling in dynamic environments , 1989 .

[30]  Stephen F. Smith,et al.  A constraint-posting framework for scheduling under complex constraints , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[31]  Yves Colombani.  Constraint Programming: an Efficient and Practical Approach to Solving the Job-Shop Problem , 1996, CP.

[32]  Nicolas Beldiceanu,et al.  Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.

[33]  Stephen F. Smith,et al.  Slack-Based Heuristics for Constraint Satisfaction Scheduling , 1993, AAAI.

[34]  Claude Le Pape.  Des systèmes d'ordonnancement flexibles et opportunistes , 1988 .

[35]  Patrick Esquirol.  Règles et processus d'inférence pour l'aide à l'ordonnancement de tâches en présence de contraintes , 1987 .

[36]  Olivier Lhomme,et al.  Consistency Techniques for Numeric CSPs , 1993, IJCAI.

[37]  Monte Zweben,et al.  Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..

[38]  E. Pinson.  Le probleme de job-shop , 1988 .

[39]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[40]  Pierre Lopez.  Approche énergétique pour l'ordonnancement de tâches sous contraintes de temps et de ressources. (Energy-based approach for task scheduling under time and resource constraints) , 1991 .

[41]  J. Erschler,et al.  Ordonnancement de tâches sous contraintes: une approche énergetique , 1992 .

[42]  Emile H. L. Aarts,et al.  Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling , 1994, European Conference on Artificial Intelligence.

[43]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[44]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[45]  P. Brucker,et al.  A branch & bound method for the general-shop problem with sequence dependent setup-times , 1996 .

[46]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[47]  Jean-francois Puget,et al.  A C++ implementation of CLP , 1997 .

[48]  Philippe Baptiste.  Constraint-Based Scheduling: Two Extensions , 1994 .

[49]  Philippe Baptiste.  Disjunctive constraints for manufacturing scheduling: Principles and extensions , 1996 .

[50]  Stephen F. Smith,et al.  Management of Temporal Constraints for Factory Scheduling , 1987, Temporal Aspects in Information Systems.