Pages that link to "Item:Q282256"
From MaRDI portal
The following pages link to A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256):
Displaying 3 items.
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← links)
- A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)