Pages that link to "Item:Q2463519"
From MaRDI portal
The following pages link to An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines (Q2463519):
Displaying 7 items.
- A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines (Q342416) (← links)
- Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
- Bounds on delay start LPT algorithm for scheduling on two identical machines in the \(l_p\) norm (Q1008788) (← links)
- A note on minimizing the sum of squares of machine completion times on two identical parallel machines (Q2358184) (← links)
- A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)