A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem

DOI10.1007/978-3-540-68155-7_21zbMath1142.68527OpenAlexW1962622810MaRDI QIDQ5387635

J. Christopher Beck, Jean-Paul Watson

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ A job-shop scheduling approach for optimising sugarcane rail operations ⋮ Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports

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

This page was built for publication: A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem