Determining the Performance Ratio of Algorithm Multifit for Scheduling
Scheduling n independent tasks nonpreemptively on m identical processors with the aim of minimizing the makespan is well-known to be NP-complete. Coffman, Garey and Johnson  described an algorithm-MULTIFIT and proved that it satisfies a bound of 1.22. Friesen  showed an example in which the upper bound is no less than 13/11. Yue, Keller and Yu proved an upper bound of 1.2. Yue gave a proof for the upper bound of 13/11, but the proof missed some casesIn this paper, a complete and simple proof is presented.
Unable to display preview. Download preview PDF.
- 3.M.Yue, H Kellerer and Z.Yu, A simple proof of the inequalityRM(MF(k))≤1.2 + (1/2)k in multiprocessor scheduling, Report NO.124, Institut fur Mathematik, Technische Universitat Graz(1988), pp. 1–10.Google Scholar
- 5.E.G.Coffman, Jr., et al., Approximation algorithms for bin-packing-an updated survey, Algorithm Design and Computer System Design, (eds.) G.Ausiello et al., CISM Courses and Lectures 284(Springer, Vienna), pp. 49–106.Google Scholar