| Article ID: | iaor19982721 |
| Country: | Germany |
| Volume: | 19 |
| Issue: | 3 |
| Start Page Number: | 219 |
| End Page Number: | 227 |
| Publication Date: | Jan 1997 |
| Journal: | OR Spektrum |
| Authors: | Krmer A. |
| Keywords: | programming: branch and bound |
Branch and bound methods for scheduling problems 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.