Highly Influenced

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

@article{Hoogeveen1994ThreeFF, 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.}, year={1994}, volume={16}, pages={129-137} }

- Published 1994 in Oper. Res. Lett.
DOI:10.1016/0167-6377(94)90024-8

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

#### From This Paper

##### Figures, tables, and topics from this paper.

36 Citations

5 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-5 of 5 references