Single machine batch scheduling with deadlines and resource dependent processing times
โ Scribed by T.C. Edwin Cheng; Mikhail Y. Kovalyov
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 519 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two g
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