Online Scheduling of Bounded Length Jobs to Maximize Throughput
From MaRDI portal
Publication:3558919
DOI10.1007/978-3-642-12450-1_11zbMath1254.68355arXiv0902.2209OpenAlexW2160166923MaRDI QIDQ3558919
Thang Nguyen Kim, Łukasz Jeż, Christoph Dürr
Publication date: 11 May 2010
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.2209
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
Online scheduling with preemption or non-completion penalties ⋮ Scheduling multipacket frames with frame deadlines ⋮ Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs ⋮ Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs