Three, four, five, six, or the complexity of scheduling with communication delays

  title={Three, four, five, six, or the complexity of scheduling with communication delays},
  author={Han Hoogeveen and Jan Karel Lenstra and Bart Veltman},
  journal={Oper. Res. Lett.},
A set of unit·time tasks has to be processed on identical parallel processors subject to precedence constraints and unit·time communication delays; does there exist aschedule of length at most d? The problem has two variants, depending on whether the number of processors is res· trictively small or not. For the first variant the question can be answered in polynomial time for d =3 and is NP-complete for d =4. The second variant is solvable in polynomial time for d =5 and Np. complete for d=6… CONTINUE READING
36 Citations
5 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 36 extracted citations


Publications referenced by this paper.
Showing 1-5 of 5 references

Ordonnancement de taches de duree unitaire avec des delais de communication unitaires sur m processeurs

  • C. Picouleau
  • 1991
1 Excerpt

Two new NP-complete scheduling problems with communication delays

  • RP, MASI, Institut Blaise Pascal, Paris. C. Picouleau
  • 1991

VET scheduling with unit interprocessor communication delays

  • A Schrijver
  • Discrete Appl . Math .
  • 1987

Optimization and approximation in deterministic sequencing and scheduling : a survey

  • AH. G. Rinnooy Kan
  • Ann . Discrete Math .
  • 1979

Similar Papers

Loading similar papers…