An Optimal Strategy for Online Non-uniform Length Order Scheduling

DOI10.1007/978-3-540-68880-8_31zbMath1143.90344OpenAlexW2096793407MaRDI QIDQ3511440

No author found.

Publication date: 10 July 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68880-8_31

zbMATH Keywords

SchedulingCompetitive RatioOnline Strategy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Nonclairvoyant scheduling
• Patience is a virtue: the effect of slack on competitiveness for admission control
• Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
• Scheduling Broadcasts with Deadlines
• A Near Optimal Scheduler for On-Demand Data Broadcasts
• Minimizing flow time nonclairvoyantly
• Improved On-Line Broadcast Scheduling with Deadlines
• Theoretical Computer Science
• Algorithmic Applications in Management