On-line machine covering
From MaRDI portal
Publication:5896852
DOI10.1007/3-540-63397-9_3zbMath1477.90017MaRDI QIDQ5896852
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
90B35: Deterministic scheduling theory in operations research
68W20: Randomized algorithms
68W27: Online algorithms; streaming algorithms
Related Items
Maximizing the Minimum Load for Selfish Agents, Semi-on-line scheduling problems for maximizing the minimum machine completion time, Fair division of indivisible goods: recent progress and open questions, Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data