Skip to main content
Conference Proceedings

The complexity of scheduling trees with communication delays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 726 LNCS 284-294
DOI: 10.1007/3-540-57273-2_63
3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the problem of finding a minimum-length schedule on m machines for a set of n unit-length tasks with a forest of intrees as precedence relation, and with unit interprocessor communication delays. First we prove that this problem is NP-complete; second we derive a linear time algorithm for the special case that m equals 2.

Cite

CITATION STYLE

APA

Lenstra, J. K., Veldhorst, M., & Veltman, B. (1993). The complexity of scheduling trees with communication delays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 726 LNCS, pp. 284–294). Springer Verlag. https://doi.org/10.1007/3-540-57273-2_63

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