Pages that link to "Item:Q583889"

The following pages link to Performance of the LPT algorithm in multiprocessor scheduling (Q583889):

Displaying 19 items.

• Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions (Q280185) (← links)
• Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
• Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm (Q806667) (← links)
• The rate of convergence to optimality of the LPT rule (Q1087469) (← links)
• Parametric bounds for LPT scheduling on uniform processors (Q1179414) (← links)
• The exact LPT-bound for maximizing the minimum completion time (Q1196214) (← links)
• Algorithms for handling skew in parallel task scheduling (Q1208591) (← links)
• Scheduling on identical machines: How good is LPT in an on-line setting? (Q1382806) (← links)
• An LPT-bound for a parallel multiprocessor scheduling problem (Q1910052) (← 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)
• (Q3095030) (← links)
• A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors (Q3325433) (← links)
• Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling (Q3329209) (← links)
• The Asymptotic Optimality of the LPT Rule (Q3770267) (← links)
• Scheduling of parallel processors: A posterior bound on LPT sequencing and a two-step algorithm (Q3971305) (← links)
• A note on LPT scheduling (Q5906502) (← links)
• Performance of critical path type algorithms for scheduling on parallel processors (Q5949904) (← links)
• Update on the Asymptotic Optimality of LPT (Q6487184) (← links)