Abstract
This paper considers scheduling deteriorating jobs on a single machine with release times and rejection. Deteriorating job means that its actual processing time is a increasing function on its execution starting time. In this situation, jobs can be rejected by paying penalties. Each job is associated with a release time. The objective is to minimize the makespan plus the total penalty incurred by rejecting jobs. We present two dynamic programming algorithms and then design an FPTAS for the considered problem.
| Original language | English |
|---|---|
| Article number | 1250032 |
| Journal | Discrete Mathematics, Algorithms and Applications |
| Volume | 4 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Jun 2012 |
Keywords
- Deteriorating job
- Rejection
- Release times
- Scheduling