Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors |
| |
| Authors: | Andreas Krämer |
| |
| Affiliation: | (1) Fachbereich Mathematik/Informatik, Universität Osnabrück, D-49069 Osnabrück, Germany;(2) Present address: Lufthansa Systems GmbH, FRA AE/DCS, Frankfurt Airport Center, Hugo-Eckner-Ring A.8.02, D-60549 Frankfurt/Main, Germany |
| |
| Abstract: | 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.Supported by the Deutsche Forschungsgemeinschaft, Project JoPTAG |
| |
| Keywords: | Branch and bound methods multiprocessor task scheduling |
| 本文献已被 SpringerLink 等数据库收录！ |
|
