haku: @freeterm approximation / yhteensä: 2
viite: 2 / 2
« edellinen | seuraava »
| Tekijä: | Kellerer, H. Strusevich, V. A. |
| Otsikko: | Scheduling parallel dedicated machines under a single non-shared resource |
| Lehti: | European Journal of Operational Research
2003 : FEB, VOL. 144:3, p. 345-364 |
| Asiasana: | Operations management Scheduling Resource allocation |
| Vapaa asiasana: | Approximation Worst-case analysis |
| Kieli: | eng |
| Tiivistelmä: | The scheduling problem of minimizing the makespan for m parallel dedicated machines under single resource constraints is considered. Heuristic algorithms employing the so-called group technology approach are presented and their worst-case behaviour is examined. Finally, a polynomial time approximation scheme is presented for the problem with fixed number of machines. |
« edellinen | seuraava »
SCIMA