A survey of results for sequencing problems with controllable processing times
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Single machine scheduling with discretely controllable processing times
Operations Research Letters
| Hi-index | 0.00 |
The paper deals with the problem of scheduling jobs on a single machine, in which each job has a release date, a delivery time and a controllable processing time, having its own associated linearly varying cost. An approximation algorithm for minimizing the overall schedule cost is provided which has the performance guarantee of @r + 12, where @r is the worst-case performance bound of a procedure used in the proposed algorithm for solving the pure sequencing problem. The best approximation procedure known has @r = 43.