Preemptive Online Scheduling with Reordering
From MaRDI portal
Publication:5902177
DOI10.1007/978-3-642-04128-0_41zbMath1256.68019OpenAlexW108538947MaRDI QIDQ5902177
Publication date: 29 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.6952
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
Semi-online scheduling: a survey, Online scheduling with rearrangement on two related machines, Optimal algorithms for online scheduling with bounded rearrangement at the end, Semi-online preemptive scheduling: one algorithm for all variants