Combining Constraint Programming and Local Search for Job-Shop Scheduling

@article{Beck2011CombiningCP,
  title={Combining Constraint Programming and Local Search for Job-Shop Scheduling},
  author={J. Christopher Beck and T. K. Feng and Jean-Paul Watson},
  journal={INFORMS Journal on Computing},
  year={2011},
  volume={23},
  pages={1-14}
}
Since their introduction, local search algorithms have consistently represented the state-ofthe-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 algorithms and the… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS
19 Citations
32 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Guided local search with shifting bottleneck for job-shop

  • E. Balas, A. Vazacopoulos
  • 1998
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…