Sciweavers

Share
CONSTRAINTS
1998

Resource Constraints for Preemptive Job-shop Scheduling

8 years 9 months ago
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.
Claude Le Pape, Philippe Baptiste
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where CONSTRAINTS
Authors Claude Le Pape, Philippe Baptiste
Comments (0)
books