Article ID Journal Published Year Pages File Type
474257 Computers & Operations Research 2007 7 Pages PDF
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
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
A simple linear time algorithm for scheduling with step-improving processing times
Authors
, , ,