Improved Bicriteria Existence Theorems for Scheduling
Abstract
Two common objectives for evaluating a schedule are the makespan, or schedule length, and the average completion time. This short note gives improved bounds on the existence of schedules that simultaneously optimize both criteria. In particular, for any rho> 0, there exists a schedule of makespan at most 1+rho times the minimum, with average completion time at most (1e)^rho times the minimum. The proof uses an infininitedimensional linear program to generalize and strengthen a previous analysis by Cliff Stein and Joel Wein (1997).
 Publication:

arXiv eprints
 Pub Date:
 May 2002
 arXiv:
 arXiv:cs/0205008
 Bibcode:
 2002cs........5008A
 Keywords:

 Computer Science  Data Structures and Algorithms;
 Computer Science  Computational Complexity;
 F.2.0;
 F.1.3
 EPrint:
 ACMSIAM Symposium on Discrete Algorithms, pp. 846847 (1999)