Three, four, five, six, or the complexity of scheduling with communication delays
Authors:
- J.A. HoogeveenJHJ.A. Hoogeveen
- J.K. LenstraJLJ.K. Lenstra
- B. VeltmanBVB. Veltman
- 1 October 1994
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 16 (3) , 129-137
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- C.P.M. Scheduling with Small Communication Delays and Task DuplicationOperations Research, 1991
- Multiprocessor scheduling with communication delaysParallel Computing, 1990
- Towards an Architecture-Independent Analysis of Parallel AlgorithmsSIAM Journal on Computing, 1990
- UET scheduling with unit interprocessor communication delaysDiscrete Applied Mathematics, 1987
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978