Better Algorithms for Minimizing Average Flow-Time on Related Machines

DOI10.1007/11786986_17zbMath1223.90024OpenAlexW1559482660MaRDI QIDQ3613759

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)

Related Items (6)

Rejecting jobs to minimize load and maximum flow-time ⋮ Minimizing average flow-time under knapsack constraint ⋮ Non-Preemptive Flow-Time Minimization via Rejections ⋮ Minimizing Average Flow Time on Unrelated Machines ⋮ Minimizing Average Flow-Time ⋮ Unnamed Item

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