Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A simple proof of the inequalityR M (MF(κ))≤1.2 + (1/2κ)

A simple proof of the inequalityR M (MF(κ))≤1.2 + (1/2κ) We consider the well-known problem of schedulingn independent tasks nonpreemptively onm identical processors with the objective of minimizing the makespan. Coffman, Garey and Johnson described an algorithm MULTIFIT, based on bin-packing, with a worst case performance better than the LPT-algorithm. The bound 1.22 obtained by them was claimed by Friesen in 1984 that it can be improved to 1.2. In this paper we give a simple proof for this bound. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

A simple proof of the inequalityR M (MF(κ))≤1.2 + (1/2κ)

Loading next page...
 
/lp/springer-journals/a-simple-proof-of-the-inequalityr-m-mf-1-2-1-2-oNZehKDHR5
Publisher
Springer Journals
Copyright
Copyright © 1992 by Science Press
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02014582
Publisher site
See Article on Publisher Site

Abstract

We consider the well-known problem of schedulingn independent tasks nonpreemptively onm identical processors with the objective of minimizing the makespan. Coffman, Garey and Johnson described an algorithm MULTIFIT, based on bin-packing, with a worst case performance better than the LPT-algorithm. The bound 1.22 obtained by them was claimed by Friesen in 1984 that it can be improved to 1.2. In this paper we give a simple proof for this bound.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 15, 2005

References