Title of article
A simple linear time algorithm for scheduling with step-improving processing times
Author/Authors
Min Ji، نويسنده , , Yong He، نويسنده , , T.C.E. Cheng، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2007
Pages
7
From page
2396
To page
2402
Abstract
We consider the problem of scheduling jobs with step-improving processing times around a common critical date on a single machine to minimize the makespan. For this problem, we present a simple linear time off-line approximation algorithm and prove its worst-case performance guarantee.
Keywords
Scheduling , Approximation algorithm , Worst-case ratio
Journal title
Computers and Operations Research
Serial Year
2007
Journal title
Computers and Operations Research
Record number
928469
Link To Document