Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10331284 | Information Processing Letters | 2005 | 9 Pages |
Abstract
We study the problem of minimizing the average weighted completion time on a single machine under the additional constraint that the sum of completion times does not exceed a given bound B(1|âCj⩽B|âwjCj) for which we propose a (2,1)-approximation algorithm. We also address the problem 1|âcjCj⩽B|âwjCj for which we present a (2,2)-approximation algorithm. After showing that the problem of minimizing two different sums of weighted completion times is intractable, we present an algorithm which computes a (2(1+É),1) (respectively (2(1+É),2))-approximate Pareto curve for the problem 1â(âCj,âwjCj) (respectively 1â(âcjCj,âwjCj)).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Eric Angel, Evripidis Bampis, Laurent Gourvès,