Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs

DOI10.1007/978-3-642-20712-9_34zbMath1332.68024OpenAlexW1603097567MaRDI QIDQ3007646

Thang Nguyen Kim

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

Mathematics Subject Classification ID

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 (2)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs