Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1976)
Computer an Job/shop Scheduling Theory
D. Friesen (1984)
Tighter Bounds for the Multifit Processor Scheduling AlgorithmSIAM J. Comput., 13
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan (1982)
Deterministic and Stochastic Schedulin'
E. Coffman, M. Garey, David Johnson (1978)
An Application of Bin-Packing to Multiprocessor SchedulingSIAM J. Comput., 7
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.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 15, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.