Constraint-Based Job Shop Scheduling with IILOG SCHEDULER

We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using ILOG SCHEDULER. A new way of calculating lower bounds on the makespan of the job shop scheduling problem is presented and we show how such results can be used within a constraint-based approach. An empirical performance analysis shows that the algorithm we developed performs well. Finally, taking the job shop scheduling problem as a start point, we discuss how constraint-based scheduling can be used to solve more general scheduling problems.

[1]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[2]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

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

[4]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[5]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[6]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[7]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[8]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[9]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

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

[11]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[12]  Xi-Ren Cao.  Perturbation analysis of discrete event systems: Concepts, algorithms, and applications , 1996 .

[13]  David B. Shmoys,et al.  A time-oriented approach to computing optimal schedules for the job-shop scheduling problem , 1996 .

[14]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[15]  Richard Bellman,et al.  The Job-shop Scheduling Problem , 1982 .

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

[17]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[18]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

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

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

[21]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[22]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[23]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[24]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[25]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

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

[27]  Philippe Baptiste,et al.  Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case , 1996, ECAI.

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

[29]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[30]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[31]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

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

[33]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

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

[35]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[36]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.