Minimizing Total Flow-Time: The Unrelated Case

DOI10.1007/978-3-540-92182-0_39zbMath1183.68107OpenAlexW1603330095MaRDI QIDQ3596738

Naveen Garg, Amit Kumar, V. N. Muralidhara

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_39

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Fixed-Parameter Approximation Schemes for Weighted Flowtime. ⋮ Minimizing Average Flow Time on Unrelated Machines ⋮ Minimizing Average Flow-Time

This page was built for publication: Minimizing Total Flow-Time: The Unrelated Case