Better Algorithms for Minimizing Average Flow-Time on Related Machines

DOI10.1007/11786986_17MaRDI QIDQ3613759zbMATH OpenOpenAlexFDO

Authors Naveen Garg, Amit Kumar

Publication date 12 March 2009

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

Full work available at URL https://doi.org/10.1007/11786986_17

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• Minimizing average flow time on related machines
• Minimizing Average Flow Time on Unrelated Machines
• Minimizing maximum flow-time on related machines
• Minimizing Maximum Flow-time on Related Machines
• Minimizing flow-time on unrelated machines

Cited in

(14)

• Minimizing Average Flow-Time
• Resource augmentation for weighted flow-time explained by dual fitting
• scientific article; zbMATH DE number 6469165 (Why is no real title available?)
• Minimizing maximum flow-time on related machines
• Minimizing average flow time on related machines
• Minimizing Average Flow Time on Unrelated Machines
• Minimizing average flow-time under knapsack constraint
• Minimizing average flow-time under knapsack constraint
• Non-preemptive flow-time minimization via rejections
• Rejecting jobs to minimize load and maximum flow-time
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
• Minimizing Maximum Flow-time on Related Machines
• Minimizing maximum (weighted) flow-time on related and unrelated machines
• Minimizing Total Flow-Time: The Unrelated Case

This page was built for publication: Better Algorithms for Minimizing Average Flow-Time on Related Machines

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