Minimizing weighted flow time

DOI10.1145/1290672.1290676zbMath1445.90029OpenAlexW2134553994MaRDI QIDQ4962678

Kedar Dhamdhere, Nikhil Bansal

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

response timeschedulingonline algorithmsnonclairvoyant scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (7)

Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine ⋮ Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling ⋮ Joint replenishment meets scheduling ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time

This page was built for publication: Minimizing weighted flow time