Online weighted flow time and deadline scheduling

DOI10.1016/j.jda.2005.12.001zbMath1120.90016MaRDI QIDQ849627

Luca Becchetti, Alberto Marchetti-Spaccamela, Kirk R. Pruhs, Stefano Leonardi

Publication date: 31 October 2006

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2005.12.001

zbMATH Keywords

scheduling; weighted flow time; on-line

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

An Optimal Control Framework for Online Job Scheduling with General Cost Functions, Unnamed Item, Unnamed Item, Competitive algorithms for due date scheduling, Nonclairvoyant speed scaling for flow and energy, Speed scaling of processes with arbitrary speedup curves on a multiprocessor, Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine, Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems, Non-clairvoyantly scheduling to minimize convex functions, From Preemptive to Non-preemptive Scheduling Using Rejections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing flow time nonclairvoyantly
• Approximation schemes for preemptive weighted flow time
• Speed is as powerful as clairvoyance
• Algorithms for minimizing weighted flow time
• LATIN 2004: Theoretical Informatics