A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Improved CLP scheduling with task intervals
Proceedings of the eleventh international conference on Logic programming
Generating feasible schedules under complex metric constraints
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Constraint (Logic) Programming: A Survey on Research and Applications
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Combining local and global search in a constraint programming environment
The Knowledge Engineering Review
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
An optimal method for the preemptive job shop scheduling problem
Computers and Operations Research
| Hi-index | 0.00 |
This paper presentsan experimental study of constraint propagation algorithms forpreemptive scheduling. We propose generalizations of non-preemptiveconstraint propagation techniques (based on timetables, on disjunctiveconstraints, and on edge-finding) to preemptive and ’’mixed‘‘problems, i.e., problems in which some activities can be interruptedand some cannot. Another approach relies on incremental flow-basedtechniques. We theoretically compare these approaches and presentan experimental comparison based on a branch and bound procedurefor the preemptive variant of the job-shop scheduling problem.We show that both edge-finding and flow-based techniques allowthe resolution of hard problem instances, including the preemptivevariant of the famous FT10.