Pages that link to "Item:Q2378450"
From MaRDI portal
The following pages link to A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450):
Displaying 8 items.
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
- Minimizing resource consumption on uniform parallel machines with a bound on makespan (Q336672) (← links)
- Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
- Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
- Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← links)
- Uniform parallel machine scheduling with resource consumption constraint (Q2009726) (← links)
- Single parameter analysis of power of preemption on two and three uniform machines (Q2339808) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
