An algorithm for solving the job-shop problem
Management Science
A fast taboo search algorithm for the job shop problem
Management Science
A branch & bound algorithm for the open-shop problem
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Constraint-Based Scheduling
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
A new particle swarm optimization for the open shop scheduling problem
Computers and Operations Research
Solution-guided multi-point constructive search for job shop scheduling
Journal of Artificial Intelligence Research
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Nogood recording from restarts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A hybrid constraint programming/local search approach to the job-shop scheduling problem
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
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
An Optimal Constraint Programming Approach to the Open-Shop Problem
INFORMS Journal on Computing
Models and strategies for variants of the job shop scheduling problem
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Complete characterization of near-optimal sequences for the two-machine flow shop scheduling problem
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains.Much previous research in systematic search approaches for these problems has focused on developing problem specific constraint propagators and ordering heuristics. Indeed, the common belief is that many of these problems are too difficult to solve without such domain specific models. We introduce a simple constraint model that combines a generic adaptive heuristic with naive propagation, and show that it often outperforms state-of-the-art solvers for both open shop and job shop problems.