Sequencing independent jobs with a single resource
✍ Scribed by Kenneth R. Baker; Henry L. W. Nuttle
- Publisher
- John Wiley and Sons
- Year
- 1980
- Tongue
- English
- Weight
- 591 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
This paper examines problems of sequencing n jobs for processing by a single resource to minimize a function of job completion times, when the availability of the resource varies over time. A number of well‐known results for single‐machine problems which can be applied with little or no modification to the corresponding variable‐resource problems are given. However, it is shown that the problem of minimizing the weighted sum of completion times provides an exception.
📜 SIMILAR VOLUMES
This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by func