The following pages link to A note on LPT scheduling (Q5906502):
Displaying 19 items.
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
- Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture (Q783686) (← links)
- The rate of convergence to optimality of the LPT rule (Q1087469) (← links)
- The exact bound of Lee's MLPT (Q1130187) (← links)
- The exact LPT-bound for maximizing the minimum completion time (Q1196214) (← links)
- The \(k\)-partitioning problem (Q1298757) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- A note on the Coffman-Sethi bound for LPT scheduling (Q2356126) (← links)
- New approximation bounds for LPT scheduling (Q2379930) (← links)
- A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)
- Scheduling of parallel processors: A posterior bound on LPT sequencing and a two-step algorithm (Q3971305) (← links)
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines (Q4367269) (← links)
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS (Q5708845) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
