Pages that link to "Item:Q1350239"
From MaRDI portal
The following pages link to Tighter bounds on a heuristic for a partition problem (Q1350239):
Displayed 13 items.
- A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines (Q342416) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- An analysis of the LPT algorithm for the max-min and the min-ratio partition problems (Q817816) (← links)
- A new model for selfish routing (Q952441) (← links)
- A tight upper bound for the \(k\)-partition problem on ideal sets (Q1306356) (← links)
- Partitioning under the \(L_p\) norm (Q1572977) (← links)
- Extending Graham's result on scheduling to other heuristics (Q1604040) (← links)
- A note on minimizing the sum of squares of machine completion times on two identical parallel machines (Q2358184) (← links)
- The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← 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)
- Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) (← links)
- Partitioning ideal sets (Q4254655) (← links)