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)

Volumn 1685 LNCS, Issue , 1999, Pages 272-279

  Corrêa, Ricardo C ^a   Ferreira, Afonso ^b  

^a Fedeal Institute of Ceará IFCE   (Brazil)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; MULTIPROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

BRANCH-AND-BOUND ALGORITHMS; FEASIBLE SOLUTION; MULTIPROCESSOR SCHEDULING PROBLEMS; POLYNOMIAL-TIME; SUB-PROBLEMS; TIME AND SPACE COMPLEXITY;

SCHEDULING;

EID: 84878658308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48311-x_35     Document Type: Conference Paper

References (9)

1. T. Casavant and J. Kuhl. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans. on Software Engineering, 14(2), 1988.
2. 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.
3. M. Cosnard and D. Trystram. Parallel Algorithms and Architectures. International Thomson Computer Press, 1995.
4. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. F. Freeman, 1979.
5. H. Kasahara and S. Narita. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Trans. on Computers, C-33(11): 1023-1029, 1984. (Pubitemid 14663498)
6. Y.-K. Kwok and I. Ahmad. Otimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques. In Proceedings Int. Conf. Paral lel Processing, 1998.
7. L. Mitten. Branch-and-bound methods: General formulation and properties. Operations Research, 18: 24-34, 1970.
8. Errata in Operations Research, 19: 550, 1971.
9. M. Norman and P. Thanisch. Models of machines and computations for mapping in multicomputers. ACM Computer Surveys, 25(9): 263-302, Sep 1993.