Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing
From MaRDI portal
Publication:4685726
DOI10.1007/978-3-319-89920-6_4zbMath1397.90189OpenAlexW2804254772MaRDI QIDQ4685726
Publication date: 9 October 2018
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_4
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Competitive snoopy caching
- On convex body chasing
- Eliminating Migration in Multi-processor Scheduling
- Chasing Convex Bodies and Functions
- Meeting Deadlines: How Much Speed Suffices?
- An optimal on-line algorithm for metrical task system
- An ℴ(log m)-Competitive Algorithm for Online Machine Minimization
- Nonmigratory Online Deadline Scheduling on Multiprocessors
- A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
- Optimal time-critical scheduling via resource augmentation
This page was built for publication: Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing