Online load balancing on uniform machines with limited migration
From MaRDI portal
Publication:6106523
DOI10.1016/j.orl.2023.02.013zbMath1525.90212arXiv2209.00565MaRDI QIDQ6106523
Publication date: 3 July 2023
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.00565
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- A robust APTAS for the classical bin packing problem
- Improved bounds for on-line load balancing
- New algorithms for related machines with temporary jobs.
- Online load balancing with general reassignment cost
- Robust online algorithms for certain dynamic packing problems
- Fully dynamic bin packing revisited
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- Robust Approximation Schemes for Cube Packing
- Robust Algorithms for Preemptive Scheduling
- Online Scheduling with Bounded Migration
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Load Balancing for Response Time
- Fully-Dynamic Bin Packing with Little Repacking
- On-line load balancing with applications to machine scheduling and virtual circuit routing
- Maintaining Assignments Online: Matching, Scheduling, and Flows
- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
- Symmetry Exploitation for Online Machine Covering with Bounded Migration
This page was built for publication: Online load balancing on uniform machines with limited migration
