Online Scheduling with Bounded Migration
From MaRDI portal
Publication:3169046
DOI10.1287/moor.1090.0381zbMath1218.90176OpenAlexW2161965494MaRDI QIDQ3169046
Peter Sanders, Naveen Sivadasan, Martin Skutella
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2005/70/
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (41)
A survey on makespan minimization in semi-online environments ⋮ Online makespan minimization with parallel schedules ⋮ Tightness of sensitivity and proximity bounds for integer linear programs ⋮ Online makespan minimization with budgeted uncertainty ⋮ Simultaneously load balancing for every p-norm, with reassignments ⋮ The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online ⋮ Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures ⋮ Online load balancing with general reassignment cost ⋮ ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER ⋮ On the value of job migration in online makespan minimization ⋮ Dynamic Windows Scheduling with Reallocation ⋮ Bin stretching with migration on two hierarchical machines ⋮ Parallel solutions for preemptive makespan scheduling on two identical machines ⋮ Machine covering in the random-order model ⋮ Online load balancing on uniform machines with limited migration ⋮ Online scheduling with rearrangement on two related machines ⋮ Unnamed Item ⋮ Online minimization of the maximum starting time: migration helps ⋮ Online bin covering with limited migration ⋮ Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ Online scheduling with one rearrangement at the end: revisited ⋮ Optimal algorithms for online scheduling with bounded rearrangement at the end ⋮ Robust algorithms for preemptive scheduling ⋮ On-line machine covering on two machines with local migration ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ Station assignment with reallocation ⋮ Scheduling In the random-order model ⋮ Online Makespan Scheduling with Job Migration on Uniform Machines ⋮ Symmetry exploitation for online machine covering with bounded migration ⋮ Robust algorithms for total completion time ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ Fully dynamic bin packing revisited ⋮ Online Bin Covering with Limited Migration ⋮ Reallocation problems in scheduling ⋮ Starting time minimization for the maximum job variant ⋮ Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes ⋮ Online makespan scheduling with job migration on uniform machines ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration ⋮ Online scheduling with migration on two hierarchical machines ⋮ Robust online algorithms for dynamic choosing problems
This page was built for publication: Online Scheduling with Bounded Migration
