Online scheduling on unbounded parallel-batch machines to minimize the makespan

DOI10.1016/j.ipl.2009.08.008zbMath1206.68072MaRDI QIDQ990962

J. Martínez

Publication date: 1 September 2010

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

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

zbMATH Keywords

algorithms; competitive ratio; makespan; online scheduling; parallel-batch machines

Mathematics Subject Classification ID

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

68W27: Online algorithms; streaming algorithms