haku: @indexterm Scheduling / yhteensä: 635
viite: 227 / 635
| Tekijä: | Gabrel, V. |
| Otsikko: | Scheduling jobs within time windows on identical parallel machines: new model and algorithms |
| Lehti: | European Journal of Operational Research
1995 : JUN8, VOL. 83:2, p. 320-329 |
| Asiasana: | SCHEDULING GRAPHS HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | This article analyzes the problem of scheduling nonpreemptive jobs processed within time windows on k identical parallel machines. Each job can be completed on a sub-set of machines. The problem of determining if a particular set of jobs can be completed by the available machines is NP-complete. A new model and heuristics are proposed to solve this problem in two particular cases: first, the case in which each job has to be completed at fixed start and end times; second, the case in which each job can be completed within a time window larger than its processing time. This approach deals with graph theory. |
SCIMA