Online Flow Time Scheduling in the Presence of Preemption Overhead
From MaRDI portal
Publication:3167387
DOI10.1007/978-3-642-32512-0_8zbMath1358.68325OpenAlexW186360080WikidataQ58062903 ScholiaQ58062903MaRDI QIDQ3167387
Rongbin Li, Ho-Leung Chan, Tak-Wah Lam
Publication date: 2 November 2012
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32512-0_8
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
This page was built for publication: Online Flow Time Scheduling in the Presence of Preemption Overhead
