Conference ProceedingsOPEN ACCESS

A polynomial-time branching procedure for the multiprocessor scheduling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1685 LNCS 272-279
DOI: 10.1007/3-540-48311-x_35
2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Corrêa, R. C., & Ferreira, A. (1999). A polynomial-time branching procedure for the multiprocessor scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 272–279). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free