Minimizing maximum (weighted) flow-time on related and unrelated machines
From MaRDI portal
Publication:513278
DOI10.1007/s00453-015-0082-yzbMath1358.90040MaRDI QIDQ513278
Publication date: 3 March 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0082-y
90B35: Deterministic scheduling theory in operations research
68W27: Online algorithms; streaming algorithms