Graphs and algorithms
The shifting bottleneck procedure for job shop scheduling
Management Science
A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Intelligent scheduling
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)
A fast taboo search algorithm for the job shop problem
Management Science
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
Gaining efficiency and flexibility in the simple temporal problem
TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
Constraint-directed search: a case study of job-shop scheduling
Constraint-directed search: a case study of job-shop scheduling
Depth-bounded discrepancy search
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Texture-based heuristics for scheduling revisited
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Improved limited discrepancy search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Combining local and global search in a constraint programming environment
The Knowledge Engineering Review
Distributed search for supply chain coordination
Computers in Industry
An optimal method for the preemptive job shop scheduling problem
Computers and Operations Research
| Hi-index | 0.00 |
In the recent years, constraint programming has been applied to a wide variety of academic and industrial non-preemptive scheduling problems, i.e., problems in which activities cannot be interrupted. In comparison, preemptive scheduling problems have received almost no attention from both the Operations Research and the Artificial Intelligence community. Motivated by the needs of a specific application, we engaged in a study of the applicability of constraint programming techniques to preemptive scheduling problems. This paper presents the algorithms we developed andthe results we obtained on the preemptive variant of the famous “job-shop scheduling problem.” Ten heuristic search strategies, combined with two different constraint propagation techniques, are presented, and compared using two well-known series of job-shop scheduling instances from the literature. The best combination, which relies on “limited discrepancy search” and on “edge-finding” techniques, is shown to provide excellent solutions to the preemptive job-shop scheduling problem. A mean relative distance to the optimal solution of 0.32% is achieved in five minutes, on instances with 10 jobs and 10 machines (100 activities).