Sequencing a single machine with due dates and deadlines: an
✍ Scribed by P. Baptiste; F. Della Croce; A. Grosso; V. T’kindt
- Publisher
- Springer US
- Year
- 2008
- Tongue
- English
- Weight
- 330 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1094-6136
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper considers the problem of optimal assignment of slack due-dates to n jobs and sequencing them on a single-machine to minimize a penalty function depending on the values of the assigned slack allowance and maximum job tardiness. It is shown that the earliest due-date order yields an optimal
The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a lo