| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 472266 | Computers & Mathematics with Applications | 2009 | 9 Pages |
Abstract
This paper deals with single-machine scheduling problems with decreasing linear deterioration, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series–parallel graph precedence constraints, respectively. It is shown that for the problems of minimization of the makespan, polynomial algorithms exist.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ji-Bo Wang,