Revisiting branch and bound search strategies for machine scheduling problems

DOI10.1023/B:JOSH.0000046075.73409.7dzbMath1154.90496OpenAlexW2094983781MaRDI QIDQ2464435

Vincent T'kindt, Carl Esswein, Frederico Della Croce

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:josh.0000046075.73409.7d

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation ⋮ A hybrid heuristic approach for single machine scheduling with release times ⋮ Single machine scheduling with interfering job sets ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees ⋮ An exact exponential branch-and-merge algorithm for the single machine total tardiness problem ⋮ The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

This page was built for publication: Revisiting branch and bound search strategies for machine scheduling problems