An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
From MaRDI portal
Publication:817816
DOI10.1016/j.tcs.2005.08.032zbMath1086.68149MaRDI QIDQ817816
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.08.032
Related Items
Cites Work
- Unnamed Item
- A tight upper bound for the \(k\)-partition problem on ideal sets
- Tighter bounds on a heuristic for a partition problem
- The modified differencing method for the set partitioning problem with cardinality constraints
- The Asymptotic Optimality of the LPT Rule
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
- Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Algorithms for Scheduling Independent Tasks
- Bounds on Multiprocessing Timing Anomalies