A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
From MaRDI portal
Publication:5387635
DOI10.1007/978-3-540-68155-7_21zbMath1142.68527MaRDI QIDQ5387635
Jean-Paul Watson, J. Christopher Beck
Publication date: 27 May 2008
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://www.osti.gov/biblio/1146052
90B35: Deterministic scheduling theory in operations research
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal speedup of Las Vegas algorithms
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- The job shop scheduling problem: Conventional and new solution techniques
- Constraint-based job shop scheduling with Ilog Scheduler
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Testing heuristics: We have it all wrong
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Benchmarks for basic scheduling problems
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- On Universal Restart Strategies for Backtracking Search
- The Complexity of Flowshop and Jobshop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Scatter Search and Path Relinking: Advances and Applications
