Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors

Autor(en): Kramer, A
Stichwörter: branch and bound methods; multiprocessor task scheduling; Operations Research & Management Science
Erscheinungsdatum: 1997
Herausgeber: SPRINGER VERLAG
Journal: OR SPEKTRUM
Volumen: 19
Ausgabe: 3
Startseite: 219
Seitenende: 227
Zusammenfassung: 
Branch and bound methods for the scheduling problem with multiprocessor tasks on dedicated processors and arbitrary precedences are presented. The methods are based on different representations of feasible schedules. Computational results show that the methods surpass each other on different types of problems with multiprocessor tasks.
ISSN: 01716468

Show full item record

Google ScholarTM

Check