An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints

DOI10.1287/ijoc.2020.0988zbMath1492.90062MaRDI QIDQ5085478

Jacobson, Sheldon H., Jason J. Sauppe, Wenda Zhang

Publication date: 27 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2020.0988

zbMATH Keywords

combinatorial optimization; branch-and-bound; one-machine scheduling

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Uses Software

• GitHub