Abstract
We present and analyze a branching procedure suitable for best-first branch-and-bound algorithms for solving multiprocessor scheduling problems. The originality of this branching procedure resides mainly in its ability to enumerate all feasible solutions without generating duplicated subproblems. This procedure is shown to be polynomial in time and space complexities.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. Casavant and J. Kuhl. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans. on Software Engineering, 14(2), 1988.
P.C. Chang and Y.S. Jiang. A State-Space Search Approach for Parallel Processor Scheduling Problems with Arbitrary Precedence Relations. European Journal of Operational Research, 77:208–223, 1994.
M. Cosnard and D. Trystram. Parallel Algorithms and Architectures. International Thomson Computer Press, 1995.
M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. F. Freeman, 1979.
H. Kasahara and S. Narita. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Trans. on Computers, C-33(11):1023–1029, 1984.
Y.-K. Kwok and I. Ahmad. Otimal and near-optimal allocation of precedenceconstrained tasks to parallel processors: defying the high complexity using effective search techniques. In Proceedings Int. Conf. Parallel Processing, 1998.
L. Mitten. Branch-and-bound methods: General formulation and properties. Operations Research, 18:24–34, 1970. Errata in Operations Research, 19:550, 1971.
M. Norman and P. Thanisch. Models of machines and computations for mapping in multicomputers. ACM Computer Surveys, 25(9):263–302, Sep 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corrêa, R.C., Ferreira, A. (1999). A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_35
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive