Pages that link to "Item:Q3169046"
From MaRDI portal
The following pages link to Online Scheduling with Bounded Migration (Q3169046):
Displaying 44 items.
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- On the Sitters-Fishkin hypothesis (Q500294) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
- On-line machine covering on two machines with local migration (Q660883) (← links)
- Station assignment with reallocation (Q666668) (← links)
- Reallocation problems in scheduling (Q747625) (← links)
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines (Q1944914) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Starting time minimization for the maximum job variant (Q2057591) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- Online minimum makespan scheduling with a buffer (Q2929632) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online (Q3460333) (← links)
- The Power of Migration for Online Slack Scheduling. (Q4606349) (← links)
- Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
- Online strip packing with polynomial migration (Q5002616) (← links)
- Fully-Dynamic Bin Packing with Little Repacking (Q5002726) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- Dynamic Windows Scheduling with Reallocation (Q5102055) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
- Automata, Languages and Programming (Q5466542) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)
- Online minimization of the maximum starting time: migration helps (Q6174813) (← links)
- Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem (Q6202754) (← links)
