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

DOI10.1007/978-3-540-68155-7_21zbMATH Open1142.68527OpenAlexW1962622810MaRDI QIDQ5387635FDOQ5387635

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Testing heuristics: We have it all wrong
• Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• The Complexity of Flowshop and Jobshop Scheduling
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Optimal speedup of Las Vegas algorithms
• Benchmarks for basic scheduling problems
• Guided local search with shifting bottleneck for job shop scheduling
• The job shop scheduling problem: Conventional and new solution techniques
• A very fast TS/SA algorithm for the job shop scheduling problem
• An advanced tabu search algorithm for the job shop problem
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
• Scatter Search and Path Relinking: Advances and Applications
• Constraint-based job shop scheduling with Ilog Scheduler
• On Universal Restart Strategies for Backtracking Search

Cited In (9)

• 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
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• A hybrid method for solving stochastic job shop scheduling problems
• A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
• Title not available (Why is that?)
• A Hybrid Approach Combining Local Search and Constraint Programming for a Large Scale Energy Management Problem
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• Depth-first heuristic search for the job shop scheduling problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387635)