Symmetry exploitation for online machine covering with bounded migration
From MaRDI portal
Publication:5009591
DOI10.4230/LIPIcs.ESA.2018.32OpenAlexW2963411374MaRDI QIDQ5009591
Waldo Gálvez, Jose A. Soto, José Verschae
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1612.01829
Related Items (6)
Online max-min fair allocation ⋮ Online bin covering with limited migration ⋮ Online Bin Covering with Limited Migration ⋮ Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes ⋮ Online scheduling with migration on two hierarchical machines ⋮ Robust online algorithms for dynamic choosing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximizing the minimum load: the cost of selfishness
- Robust algorithms for preemptive scheduling
- A robust APTAS for the classical bin packing problem
- The exact LPT-bound for maximizing the minimum completion time
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Performance Guarantees of Local Search for Multiprocessor Scheduling
- The Power of Dynamic Distance Oracles
- Online Scheduling with Bounded Migration
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
- The Power of Recourse for Online MST and TSP
- On-line machine covering
This page was built for publication: Symmetry exploitation for online machine covering with bounded migration
