Name
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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-48311-X_35 | Euro-Par |
Keywords | Field | DocType |
best-first branch-and-bound algorithm,polynomial-time branching procedure,multiprocessor scheduling problem,feasible solution,space complexity,multiprocessor scheduling,branch and bound algorithm,polynomial time | Mathematical optimization,Multiprocessor scheduling,Polynomial,Scheduling (computing),Computer science,Parallel computing,Multiprocessing,Branch and bound method,Time complexity,Branching (version control),Search tree | Conference |
Volume | ISSN | ISBN |
1685 | 0302-9743 | 3-540-66443-2 |
Citations | PageRank | References |
2 | 0.40 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ricardo C. Corrêa | 1 | 207 | 18.74 |
| Afonso Ferreira | 2 | 83 | 6.52 |