Minimizing Average Flow-Time

DOI10.1007/978-3-642-03456-5_13zbMath1258.90037OpenAlexW2101867823MaRDI QIDQ3644722

Naveen Garg

Publication date: 12 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_13

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing total flow time and total completion time with immediate dispatching
• On the single-source unsplittable flow problem
• Nonclairvoyant scheduling
• Minimizing the flow time without migration
• Minimizing average flow time on related machines
• Approximation schemes for preemptive weighted flow time
• Minimizing Total Flow-Time: The Unrelated Case
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
• Algorithms for minimizing weighted flow time

This page was built for publication: Minimizing Average Flow-Time