Minimizing Total Flow-Time: The Unrelated Case

DOI10.1007/978-3-540-92182-0_39MaRDI QIDQ3596738zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Minimizing flow-time on unrelated machines
• Minimizing Average Flow Time on Unrelated Machines
• Minimizing average flow time on related machines
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines

Cited in

(7)

• Minimizing average flow-time under knapsack constraint
• Minimizing flow-time on unrelated machines
• Minimizing Average Flow Time on Unrelated Machines
• Minimizing Average Flow-Time
• Fixed-parameter approximation schemes for weighted flowtime
• On minimizing the total flow time on multiple machines
• Minimizing average flow-time under knapsack constraint

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596738)