A note on MULTIFIT scheduling for uniform machines
From MaRDI portal
Publication:1272356
DOI10.1007/BF02684354zbMath0913.90161MaRDI QIDQ1272356
Publication date: 21 December 1998
Published in: Computing (Search for Journal in Brave)
Related Items
Cites Work
- Tighter bound for MULTIFIT scheduling on uniform processors
- Parametric bounds for LPT scheduling on uniform processors
- Scheduling Independent Tasks on Uniform Processors
- Bounds for Multifit Scheduling on Uniform Processors
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Bounds for LPT Schedules on Uniform Processors
- An Application of Bin-Packing to Multiprocessor Scheduling
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines