A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem

Authors:
Ricardo C. Corrêa;Afonso Ferreira
Affiliations:
-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 6
Cited 0

Models of machines and computation for mapping in multicomputers

ACM Computing Surveys (CSUR)
Parallel Algorithms and Architectures

Parallel Algorithms and Architectures
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A taxonomy of scheduling in general-purpose distributed computing systems

IEEE Transactions on Software Engineering
Optimal and Near-Optimal Allocation of Precedence-Constrained Tasks to Parallel Processors: Defying the High Complexity Using Effective Search Techniques

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.