Return
A simple linear time algorithm for scheduling with step-improving processing times
DOI:10.1016/j.cor.2005.09.011.png)
Abstract
En 中文
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. (c) 2005 Elsevier Ltd. All rights reserved.
Keywords:
scheduling
approximation algorithm
worst-case ratio
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
2.3W
Organization
No organization information available

