An algorithm for solving the job-shop problem
Management Science
Dual viewpoint heuristics for binary constraint satisfaction problems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
A memetic algorithm for the job-shop with time-lags
Computers and Operations Research
Job shop scheduling with setup times, deadlines and precedence constraints
Journal of Scheduling
A fast hybrid tabu search algorithm for the no-wait job shop problem
Computers and Industrial Engineering
Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Solution-guided multi-point constructive search for job shop scheduling
Journal of Artificial Intelligence Research
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
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
Computers and Operations Research
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
Closing the open shop: contradicting conventional wisdom
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Why cumulative decomposition is not as bad as it sounds
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
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
Compiling finite linear CSP into SAT
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
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
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
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
In previous work we introduced a simple constraint model that combined generic AI strategies and techniques (weighted degree heuristic, geometric restarts, nogood learning from restarts) with naive propagation for job shop and open shop scheduling problems. Here, we extend our model to handle two variants of the job shop scheduling problem: job shop problems with setup times; and job shop problems with maximal time lags. We also make some important additions to our original model, including a solution guidance component for search. We show empirically that our new models often outperform the state of the art techniques on a number of known benchmarks for these two variants, finding a number of new best solutions and proving optimality for the first time on some problems. We provide some insight into the performance of our approach through analysis of the constraint weighting procedure.