Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
✍ Scribed by J.A. Hoogeveen
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 210 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
✦ Synopsis
We consider the problem of scheduling n jobs on a single machine that is continuously available from time zero onward and that can handle no more than one job at a time. Each job requires processing during a given positive uninter-Ž . rupted time. The cost of each job is measured by K Ks2, 3 nondecreasing penalty functions; the quality of a schedule is computed on the basis of K performance criteria, the kth one being given by the maximum value of the kth penalty function over all jobs. We wish to minimize an objective function that is a nondecreasing function of these K performance criteria. We present a polynomial algorithm for both problems and we show that these can also be used if precedence constraints exist between the jobs or if all penalty functions are nonincreasing in the job completion times.