Competitive algorithms for the online minimum peak job scheduling

DOI10.1287/OPRE.2021.0080MaRDI QIDQ7009350zbMATH OpenFDO

Authors Célia Escribe, Michael H. Hu, Retsef Levi

Publication date 20 March 2025

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/OPRE.2021.0080

zbMATH Keywords

bin packingcompetitive analysisonline algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cited in

(1)

• Lower bounds on the performance of online algorithms for relaxed packing problems

This page was built for publication: Competitive algorithms for the online minimum peak job scheduling

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