Online scheduling with bounded migration
From MaRDI portal
Recommendations
Cited in
(50)- A survey on makespan minimization in semi-online environments
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
- Scheduling In the random-order model
- Robust algorithms for total completion time
- Exact lexicographic scheduling and approximate rescheduling
- 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
- Online scheduling with migration on two hierarchical machines
- Robust online algorithms for dynamic choosing problems
- Online load balancing with general reassignment cost
- Fully dynamic bin packing revisited
- Online bin covering with limited migration
- Online minimum makespan scheduling with a buffer
- 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
- Online scheduling with one rearrangement at the end: revisited
- The power of migration for online slack scheduling
- Simultaneously load balancing for every p-norm, with reassignments
- Robust algorithms for preemptive scheduling
- Online strip packing with polynomial migration
- Fully-dynamic bin packing with little repacking
- On the Sitters-Fishkin hypothesis
- Online Makespan Scheduling with Job Migration on Uniform Machines
- Symmetry exploitation for online machine covering with bounded migration
- Online Bin Covering with Limited Migration
- Dynamic windows scheduling with reallocation
- A robust AFPTAS for online bin packing with polynomial migration
- Nonmigratory Online Deadline Scheduling on Multiprocessors
- Automata, Languages and Programming
- Symmetry Exploitation for Online Machine Covering with Bounded Migration
- 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 minimization of the maximum starting time: migration helps
- Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
- Online scheduling with rearrangement on two related machines
- Online unrelated-machine load balancing and generalized flow with recourse
- Optimal algorithms for online scheduling with bounded rearrangement at the end
- On-line machine covering on two machines with local migration
- Station assignment with reallocation
- Scheduling in the random-order model
- Robust scheduling on uniform machines. New results using a relaxed approximation guarantee
- Fully-dynamic load balancing
- Makespan minimization for ordinal cardinality constrained scheduling
- Fully-dynamic load balancing
- Reallocation problems in scheduling
- Tightness of sensitivity and proximity bounds for integer linear programs
- Online makespan minimization with budgeted uncertainty
This page was built for publication: Online scheduling with bounded migration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169046)
