Pages that link to "Item:Q2173053"
From MaRDI portal
The following pages link to The longest processing time rule for identical parallel machines revisited (Q2173053):
Displaying 11 items.
- Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
- A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times (Q1271384) (← links)
- An improved algorithm for a two-stage production scheduling problem with an outsourcing option (Q2034787) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
- A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450) (← links)
- The Asymptotic Optimality of the LPT Rule (Q3770267) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
- Update on the Asymptotic Optimality of LPT (Q6487184) (← links)
- Automated placement of analog integrated circuits using priority-based constructive heuristic (Q6568458) (← links)