Pages that link to "Item:Q1306356"
From MaRDI portal
The following pages link to A tight upper bound for the \(k\)-partition problem on ideal sets (Q1306356):
Displayed 3 items.
- A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines (Q342416) (← links)
- An analysis of the LPT algorithm for the max-min and the min-ratio partition problems (Q817816) (← links)
- A note on minimizing the sum of squares of machine completion times on two identical parallel machines (Q2358184) (← links)