Optimal speedup of Las Vegas algorithms
Information Processing Letters
A fast taboo search algorithm for the job shop problem
Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Management Science
Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
Artificial Intelligence
Constraint-Based Scheduling
Constraint-Based Job Shop Scheduling with {\sc Ilog\ Scheduler}
Journal of Heuristics
Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem
Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A very fast TS/SA algorithm for the job shop scheduling problem
Computers and Operations Research
Solution-guided multi-point constructive search for job shop scheduling
Journal of Artificial Intelligence Research
On universal restart strategies for backtracking search
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Guided Ejection Search for the Job Shop Scheduling Problem
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Closing the open shop: contradicting conventional wisdom
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Integrated heuristics for scheduling multiple order jobs in a complex job shop
International Journal of Metaheuristics
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
Understanding the behavior of Solution-Guided Search for job-shop scheduling
Journal of Scheduling
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
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
Hi-index | 0.00 |
Since their introduction, local search algorithms - and in particular tabu search algorithms - have consistently represented the state-of-the-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a simple hybrid algorithm for job-shop scheduling that leverages both the fast, broad search capabilities of modern tabu search and the scheduling-specific inference capabilities of constraint programming. The hybrid algorithm significantly improves the performance of a state-of-the-art tabu search for the job-shop problem, and represents the first instance in which a constraint programming algorithm obtains performance competitive with the best local search algorithms. Further, the variability in solution quality obtained by the hybrid is significantly lower than that of pure local search algorithms. As an illustrative example, we identify twelve new best-known solutions on Taillard's widely studied benchmark problems.