Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs
From MaRDI portal
Publication:3007646
DOI10.1007/978-3-642-20712-9_34zbMath1332.68024MaRDI QIDQ3007646
Publication date: 17 June 2011
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_34
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W27: Online algorithms; streaming algorithms
Related Items
Online scheduling with preemption or non-completion penalties, Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
Cites Work
- On-line scheduling with tight deadlines.
- Online scheduling with partial job values: does timesharing or randomization help?
- Scheduling broadcasts with deadlines
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- Improved On-Line Broadcast Scheduling with Deadlines
- Computing and Combinatorics
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
- Unnamed Item
- Unnamed Item
- Unnamed Item