Abstract
Purchase PDF (605 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (28)
Purchase PDF (507 K)
doi:10.1016/S0167-6377(97)00025-4 
Copyright © 1997 Published by Elsevier Science B.V.
On the existence of schedules that are near-optimal for both makespan and total weighted completion time
Received 1 June 1996;
revised 1 February 1997.
Available online 10 June 1998.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We give a simple proof that, for any instance of a very general class of scheduling problems, there exists a schedule of makespan at most twice that of the optimal possible and of total weighted completion time at most twice that of the optimal possible. We then refine the analysis, yielding variants of this theorem with improved constants, and give some algorithmic consequences of the technique.
Author Keywords: Deterministic sequencing; Single machine and multiple machine
