We consider scheduling problems for shops in which a job set is manufactured repetitively. Jobs are scheduled to minimize the cycle time of the job set, which is equivalent to maximizing the throughput rate. We characterize the complexity of the scheduling problem for several types of job shops. Pol
Complexity of vehicle routing and scheduling problems
โ Scribed by J. K. Lenstra; A. H. G. Rinnooy Kan
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 371 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The problems of scheduling groups of jobs under the group technology assumption are studied. The two remaining open questions posed in the literature a decade ago about the computational complexity of these problems (J. Oper. Res. Soc., 1992; 43:395 -406), are answered. The parallel machine problem
## Abstract The world's second largest producer of pork, Danish Crown, also provides a fresh meat supply logistics system within Denmark. This is used by the majority of supermarkets in Denmark. This article addresses an integrated vehicle routing and driver scheduling problem arising at Danish Cro