Minimizing the flow time without migration
From MaRDI portal
Publication:2819546
DOI10.1145/301250.301304zbMath1345.68025OpenAlexW2074109829MaRDI QIDQ2819546
Baruch Awerbuch, Stefano Leonardi, Oded Regev, Yossi Azar
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301304
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (10)
Average stretch without migration ⋮ Maximizing job benefits on-line ⋮ SPT is optimally competitive for uniprocessor flow ⋮ Greedy multiprocessor server scheduling ⋮ Optimal on-line flow time with resource augmentation ⋮ Minimizing flow time on a constant number of machines with preemption ⋮ Minimizing Average Flow Time on Unrelated Machines ⋮ Order Scheduling Models: Hardness and Algorithms ⋮ Minimizing Average Flow-Time ⋮ On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
This page was built for publication: Minimizing the flow time without migration
