On-line machine covering

DOI10.1007/3-540-63397-9_3zbMath1477.90017OpenAlexW2154716867MaRDI QIDQ5896852

Leah Epstein, Yossi Azar

Publication date: 20 December 2021

Published in: Algorithms — ESA '97 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63397-9_3

zbMATH Keywords

competitive ratiooptimal assignmentcompetitive algorithmidentical machineminimum load

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Fair division of indivisible goods: recent progress and open questions ⋮ Semi-on-line scheduling problems for maximizing the minimum machine completion time ⋮ Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data ⋮ Maximizing the Minimum Load for Selfish Agents

This page was built for publication: On-line machine covering