Referenced Items are not available for this document.
This paper proposes a fast branch-and-bound algorithm for solving the multiprocessor scheduling problem. The key point of our method is the proposal of an efficient quadratic algorithm for calculating the Fernandez and Bussell's (1973) lower bound. In the following, we discuss about the trade-off between the cost for calculating a lower bound and the size of pruned subtrees. Several experiments are conducted to evaluate the goodness of the proposed method.
Published in:
Parallel and Distributed Systems, 2002. Proceedings. Ninth International Conference on
Date of Conference: 17-20 Dec. 2002
- Page(s):
- 611 - 616
- ISSN :
- 1521-9097
- Print ISBN:
- 0-7695-1760-9
- INSPEC Accession Number:
- 7644566
- Digital Object Identifier :
- 10.1109/ICPADS.2002.1183469
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
