We deal with a single machine scheduling problem in which each job has a release date, a delivery time and a controllable processing time. The fact that the jobs have a controllable processing time means that it is allowed to compress (a part of) the processing time of the job, in return for compression cost. The objective is to find a schedule that minimizes the total cost, that is, the latest delivery time of any job plus the total compression cost. In this note we discuss how the techniques of Hall and Shmoys [?] and Hall [?] can directly be applied to design a polynomial time approximation scheme for this problem. Keywords. Scheduling, worst case analysis, approximation algorithm, approximation scheme, controllable processing time.
|Publication status||Published - 2002|
- Worst case analysis
- Approximation Algorithm
- Approximation scheme
- Controllable processing time