Combining Constraint Programming and Local Search for Job-Shop Scheduling

Authors:
J. Christopher Beck;T. K. Feng;Jean-Paul Watson
Affiliations:
Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario M5S 3G8, Canada;Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario M5S 3G8, Canada;Discrete Math and Complex Systems Department, Sandia National Laboratories, Albuquerque, New Mexico 87185
Venue:
INFORMS Journal on Computing
Year:
2011

Citing 20
Cited 4

Optimal speedup of Las Vegas algorithms

Information Processing Letters
Empirical methods for artificial intelligence

Empirical methods for artificial intelligence
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
Introduction to Reinforcement Learning

Introduction to Reinforcement Learning
Constraint-Based Scheduling

Constraint-Based Scheduling
Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results

Artificial Intelligence
Algorithm Selection using Reinforcement Learning

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
A Bayesian Approach to Tackling Hard Computational Problems

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Learning evaluation functions to improve optimization by local search

The Journal of Machine Learning Research
An Advanced Tabu Search Algorithm for the Job Shop Problem

Journal of Scheduling
Statistical Regimes Across Constrainedness Regions

Constraints
Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem

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
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
Slack-based heuristics for constraint satisfaction scheduling

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence

A competent memetic algorithm for complex scheduling

Natural Computing: an international journal
A hybrid harmony search algorithm for the flexible job shop scheduling problem

Applied Soft Computing
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

Journal of Intelligent Manufacturing
An integrated search heuristic for large-scale flexible job shop scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since their introduction, local search algorithms have consistently represented the state of the art in solution techniques for the classical job-shop scheduling problem. This dominance 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 algorithms and the scheduling-specific inference capabilities of constraint programming. The hybrid algorithm significantly improves the performance of a state-of-the-art tabu search algorithm 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. Furthermore, the variability in solution quality obtained by the hybrid is significantly lower than that of pure local search algorithms. Beyond performance demonstration, we perform a series of experiments that provide insights into the roles of the two component algorithms in the overall performance of the hybrid.