Improved Bicriteria Existence Theorems for Scheduling

Details Improved Bicriteria Existence Theorems for Scheduling Improved Bicriteria Existence Theorems for Scheduling

2002-05-10

arxiv.org/abs/cs/0205008v1

ACM-SIAM Symposium on Discrete Algorithms, pp. 846-847 (1999)

Computer Science

Data Structures and Algorithms

Scientific paper

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 (1-e)^rho times the minimum. The proof uses an infininite-dimensional linear program to generalize and strengthen a previous analysis by Cliff Stein and Joel Wein (1997).

Affiliated with

Also associated with

No associations

Rating

Improved Bicriteria Existence Theorems for Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Bicriteria Existence Theorems for Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Bicriteria Existence Theorems for Scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-382464