Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines

DOI10.1007/978-3-642-39206-1_2zbMath1336.90032OpenAlexW1572148396MaRDI QIDQ5326546

No author found.

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_2

Mathematics Subject Classification ID

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

Related Items (2)

Rejecting jobs to minimize load and maximum flow-time ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines

This page was built for publication: Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines