Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems

DOI10.1016/S0377-2217(99)00488-9zbMath0990.90038OpenAlexW2093629818MaRDI QIDQ1590040

Christian Prins, Christelle Guéret, Narendra Jussien

Publication date: 19 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00488-9

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

New efficient heuristics for scheduling open shops with makespan minimization, Unnamed Item, A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, Four decades of research on the open-shop scheduling problem to minimize the makespan, Dynamic programming approach for solving the open shop problem, An Optimal Constraint Programming Approach to the Open-Shop Problem, Local search with constraint propagation and conflict-based heuristics

Cites Work

• Unnamed Item
• Unnamed Item
• A block approach for single-machine scheduling with release dates and due dates
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
• Classical and new heuristics for the open-shop problem: A computational evaluation
• A branch and bound algorithm for the job-shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• A branch \(\&\) bound algorithm for the open-shop problem
• Benchmarks for basic scheduling problems
• On a routing problem
• An Algorithm for Solving the Job-Shop Problem
• Open Shop Scheduling to Minimize Finish Time