Minimizing average flow time on related machines

DOI10.1145/1132516.1132618zbMath1301.68272OpenAlexW2072626473MaRDI QIDQ2931433

Naveen Garg, Amit Kumar

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1132516.1132618

zbMATH Keywords

schedulingcompetitive ratioapproximation algorithmsflow-time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

Minimizing average flow-time under knapsack constraint ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Minimizing Average Flow Time on Unrelated Machines ⋮ Minimizing Average Flow-Time

This page was built for publication: Minimizing average flow time on related machines