A due-date assignment model for a flow shop with application in a lightguide cable shop
โ Scribed by J.R. Rajasekera; M.R. Murr; K.C. So
- Publisher
- Society of Manufacturing Engineers
- Year
- 1991
- Tongue
- English
- Weight
- 487 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0278-6125
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract This paper deals with a repair shop with multiple parallel servers, which has to carry out planned overhauls. Each overhaul consists of a large number of maintenance jobs. The overhaul process is interrupted by randomly arriving emergency jobs. To control the delivery performance of the
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