Dynamic Windows Scheduling with Reallocation
From MaRDI portal
Publication:5102055
DOI10.1145/3462208zbMath1499.90073arXiv1404.1087OpenAlexW3181265918MaRDI QIDQ5102055
Christopher Thraves Caro, Katia Leal, Miguel A. Mosteiro, Martín Farach-Colton
Publication date: 6 September 2022
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.1087
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Semi-on-line bin packing: a short overview and a new lower bound
- Reallocation problems in scheduling
- Minimizing makespan and preemption costs on a system of uniform machines
- Dynamic bin packing with unit fraction items revisited
- Online inventory replenishment scheduling of temporary orders
- Dynamic bin packing of unit fractions items
- On-line bin packing with restricted repacking
- Minimizing total completion time subject to job release dates and preemption penalties
- Online Scheduling with Bounded Migration
- Windows scheduling as a restricted version of bin packing
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- Windows Scheduling Problems for Broadcast Systems
- Load Balancing for Response Time
- A general buffer scheme for the windows scheduling problem
- Minimizing Service and Operation Costs of Periodic Scheduling
- Algorithms and Computation
This page was built for publication: Dynamic Windows Scheduling with Reallocation
