Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

DOI10.1016/j.ipl.2010.04.008zbMath1229.90057MaRDI QIDQ656603

Juan-Miguel Gracia

Publication date: 18 January 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.008

zbMATH Keywords

competitive ratio; online scheduling; limited restart; parallel-batching machines

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