Packing-based branch-and-bound for discrete malleable task scheduling

DOI10.1007/s10951-022-00750-wzbMath1501.90024MaRDI QIDQ2093190

Roland Braune

Publication date: 4 November 2022

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

Full work available at URL: https://doi.org/10.1007/s10951-022-00750-w

zbMATH Keywords

multiprocessor scheduling; branch-and-bound; precedence constraints; bin packing; malleable tasks

Mathematics Subject Classification ID

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

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

Uses Software

• Bison