A Constraint Program for Solving the Job-Shop Problem (1996) [4 citations — 0 self]
|
Abstract:
In this paper, a method within the framework of propagation of interval constraints and based on the branch-and-bound optimization scheme for solving the job-shop scheduling problem will be presented. The goal is to provide a constraint program which is clean, AEexible and robust. The design of the constraint program is based on an idea of sorting the release and due dates of tasks, which is a successful application of a previous but not yet published work on a distinct integers constraint. Based on the sorting constraint, by assembling redundant constraints and applying an eOEcient search strategy, the current program for the job-shop problem can solve the ten 10 \Theta 10 instances in the paper of Applegate and Cook (1991) in satisfactory computational time. Moreover, good results have been achieved on some harder instances.
Citations
| 286 | An introduction to prolog III – Colmerauer - 1990 |
| 155 | Applying interval arithmetic to real, integer, and Boolean constraints – Benhamou, Older - 1997 |
| 138 | A computational study of the job-shop scheduling problem – Applegate, Cook - 1991 |
| 97 | An algorithm for solving the job-shop problem – Carlier, Pinson - 1989 |
| 81 | Improved CLP Scheduling with Task Intervals – Caseau, Laburthe - 1994 |
| 79 | M.: Constraint Satisfaction Using Constraint Logic Programming – Hentenryck, Simonis, et al. - 1994 |
| 64 | Adjustment of heads and tails for the job-shop problem – Carlier, Pinson - 1994 |
| 19 | Constraint-based optimization and approximation for job-shop scheduling – Baptiste, Pape, et al. - 1995 |
| 3 | Adapting CLP(R) to Floating Point Arithmetic – Lee, Emden - 1991 |
| 2 | Disjunctive Scheduling with Task Intervals, LIENS – Laburthe - 1995 |
| 2 | Getting to the Real Problem: experience with BNR – Older, Emden, et al. - 1995 |
| 1 | Solving the job-shop problem by constraint programming – Zhou - 1995 |
