Title of article
An approximation algorithm for scheduling on three dedicated machines Original Research Article
Author/Authors
Michel X. Goemans، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
11
From page
49
To page
59
Abstract
We consider the scheduling problem of minimizing the makespan on three dedicated machines. We present a 76-approximation algorithm, improving the previously best performance guarantee of 54.
Journal title
Discrete Applied Mathematics
Serial Year
1995
Journal title
Discrete Applied Mathematics
Record number
884257
Link To Document