Online scheduling on unbounded parallel-batch machines with incompatible job families

DOI10.1016/j.tcs.2011.01.023zbMath1216.68347MaRDI QIDQ533882

Yong-Cai Geng, Sumit K. Garg

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.023

zbMATH Keywords

competitive ratio; online scheduling; parallel-batch machines; incompatible job families

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W27: Online algorithms; streaming algorithms