Minimizing Average Flow-Time

DOI10.1007/978-3-642-03456-5_13MaRDI QIDQ3644722zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Minimizing weighted flow time
• scientific article; zbMATH DE number 2079378
• Minimizing average flow time on related machines
• Minimizing Average Flow Time on Unrelated Machines
• Minimizing Schedule Length Subject to Minimum Flow Time
• Minimizing average flow-time under knapsack constraint
• Minimizing average flow-time under knapsack constraint
• Mean flow time minimization with given bounds of processing times
• Minimizing the maximum flow time in batch scheduling
• Minimizing flow time nonclairvoyantly

Cites work

• A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
• Algorithms for minimizing weighted flow time
• Approximation schemes for preemptive weighted flow time
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• scientific article; zbMATH DE number 2079378 (Why is no real title available?)
• scientific article; zbMATH DE number 1559527 (Why is no real title available?)
• Minimizing average flow time on related machines
• Minimizing the flow time without migration
• Minimizing total flow time and total completion time with immediate dispatching
• Minimizing Total Flow-Time: The Unrelated Case
• Nonclairvoyant scheduling
• On the single-source unsplittable flow problem

Cited in

(4)

• Minimizing Average Flow Time on Unrelated Machines
• scientific article; zbMATH DE number 2079378 (Why is no real title available?)
• scientific article; zbMATH DE number 6469165 (Why is no real title available?)
• Minimizing total flow time and total completion time with immediate dispatching

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

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