# zbMATH — the first resource for mathematics

On the complexity of scheduling with large communication delays. (English) Zbl 0947.90573
Summary: Given a directed acyclic graph (dag) with unit execution time tasks and constant communication delays $$c\geq 2$$, we are interested in deciding if there is a schedule for the dag of length at most $$L$$. We prove that the problem is polynomial when $$L$$ is equal to $$(c+1)$$, or $$(c+2)$$ for the special case of $$c=2$$, and that it is NP-complete for $$(c+3)$$ for any value of $$c$$, even in the case of a bipartite dag of depth one.

##### MSC:
 90B35 Deterministic scheduling theory in operations research
Full Text:
##### References:
 [1] Błażewicz, J.; Ecker, K.H.; Schmidt, G.; Weglarz, J., Scheduling in computer and manufacturing systems, (1994), Springer-Verlag Berlin · Zbl 0816.90068 [2] Chrétienne, P.; Picouleau, C., Scheduling with communication delays: A survey, () [3] Coffman, E.G.; Denning, P.J., Operating systems theory, (1976), Wiley New York [4] Garey, M.R.; Johnson, D.S., Computers and intractability. A guide to the theory of NP-completeness, (1979), Freeman San Francisco, CA · Zbl 0411.68039 [5] Hoogeveen, J.A.; Lenstra, J.K.; Veltman, B., Three, four, five, six or the complexity of scheduling with communication delays, Operations research letters, 16, 129-137, (1994) · Zbl 0816.90083 [6] Graham, R.L.; Lawler, E.L.; Lenstra, J.K.; Rinnooy Kan, A.H.G., Optimization and approximation in deterministic scheduling: A survey, Annals of discrete mathematics, 5, 287-326, (1979) · Zbl 0411.90044 [7] Lenstra, J.K.; Rinnooy Kan, A.H.G., Complexity of scheduling under precedence constraints, Operations research, 26, 22-35, (1978) · Zbl 0371.90060 [8] Leung, J.Y.-T., On scheduling independent tasks with restricted execution times, Operations research, 30, 163-171, (1982) · Zbl 0481.90046 [9] Papadimitriou, C.; Yannakakis, M., Towards an architecture-independent analysis of parallel algorithms, SIAM journal on computing, 19, 2, 322-328, (1990) · Zbl 0692.68032 [10] Picouleau, C., Etude des problèmes d’optimisation dans LES systèmes distribues, () [11] Rayward-Smith, V.J., UET scheduling with unit interprocessor communication delays, Discrete applied mathematics, 18, 55-71, (1987) · Zbl 0634.90031 [12] Saad, R., Scheduling with communication delays, Journal of combinatorial mathematics and combinatorial computing, 18, 214-224, (1995) · Zbl 0833.68019 [13] van Leeuwen, J., Graph algorithms, (), 525-632 · Zbl 0900.68258 [14] Veltman, B., Multiprocessor scheduling with communication delays, () · Zbl 0711.68017 [15] Veltman, B.; Lageweg, B.J.; Lenstra, J.K., Multiprocessor scheduling with communication delays, Parallel computing, 16, 173-182, (1990) · Zbl 0711.68017
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.