Rejecting jobs to Minimize Load and Maximum Flow-time
From MaRDI portal
Publication:5363003
DOI10.1137/1.9781611973730.75zbMath1372.68045arXiv1410.1839OpenAlexW2949398645MaRDI QIDQ5363003
Anamitra R. Choudhury, Syamantak Das, Amit Kumar, Naveen Garg
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.1839
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Minimizing the maximum flow time in the online food delivery problem ⋮ A best possible online algorithm for minimizing the total completion time and the total soft penalty cost ⋮ Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ From Preemptive to Non-preemptive Scheduling Using Rejections
This page was built for publication: Rejecting jobs to Minimize Load and Maximum Flow-time
