Jobshop Scheduling with task intervals
Download:
|
|
unknown authors
ftp://ubolib.univ-brest.fr/pub/reports/CCS95/r45.ps.gz
Add To MetaCart
Abstract:
This paper presents a technique for scheduling based on sets of tasks. Used within a branch & bound algorithm, it cuts branches very efficiently. It is thus well adapted for proofs of optimality. This technique solves typical hard 10 \Theta 10 problems within a few thousand backtracks and is also adapted to large problems. LA21, a 15 \Theta 10 problem open since 1984 is solved and a new bound is given for LA29, a 20 \Theta 10 problem.
Citations
| 65 | Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement – Lawrence - 1984 |
| 35 | Industrial Scheduling – Muth, Thompson - 1963 |
| 27 | A deductive and object-oriented approach to a complex scheduling problem – Caseau, Guillo, et al. - 1993 |
| 26 | Hentenryck, Constraint satisfaction in logic programming – van - 1989 |
| 8 | An Algorithm for Solving the Job – Carlier, Pinson - 1989 |
| 4 | A computational study of the job-shop problem – Applegate, Cook - 1991 |
| 1 | Aarts & J.K. Lenstra Job Shop by Simmulated Annealing – Larrhoven, E |
