A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

DOI10.1007/s10951-010-0172-2zbMath1229.90067MaRDI QIDQ657251

Juan-Miguel Gracia

Publication date: 16 January 2012

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

Full work available at URL: https://doi.org/10.1007/s10951-010-0172-2

zbMATH Keywords

competitive ratio; online algorithm; restart; parallel-batch scheduling

Mathematics Subject Classification ID

68W40: Analysis of algorithms

90B35: Deterministic scheduling theory in operations research

68W27: Online algorithms; streaming algorithms