A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
From MaRDI portal
Publication:5172765
DOI10.1145/1536414.1536506zbMath1304.90089OpenAlexW2102252987MaRDI QIDQ5172765
V. N. Muralidhara, Jivitej S. Chadha, Amit Kumar, Naveen Garg
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536506
Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (9)
An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ Non-Preemptive Flow-Time Minimization via Rejections ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Scheduling parallel jobs online with convex and concave parallelizability ⋮ Minimizing Average Flow-Time ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
