Pages that link to "Item:Q3186540"
From MaRDI portal
The following pages link to Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540):
Displaying 18 items.
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← 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)
- Approximate and robust bounded job start scheduling for Royal Mail delivery offices (Q2061143) (← 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 bin covering with limited migration (Q2689369) (← links)
- (Q5002616) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← 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)