The following pages link to (Q5501827):
Displayed 15 items.
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- A new model for selfish routing (Q952441) (← links)
- A tight upper bound for the \(k\)-partition problem on ideal sets (Q1306356) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Partitioning under the \(L_p\) norm (Q1572977) (← links)
- Extending Graham's result on scheduling to other heuristics (Q1604040) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines (Q2463519) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm (Q3511378) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)