Machine scheduling with transportation considerations
β Scribed by Chung-Yee Lee; Zhi-Long Chen
- Publisher
- Springer US
- Year
- 2001
- Tongue
- English
- Weight
- 183 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1094-6136
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated parallel machines. Each job j has a processing time and a deadline, the time at which the job must be completed. On each machine, jobs may be grouped to form batches containing continuously scheduled
## Abstract In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means