Scheduling series–parallel orders subject to 0/1-communication delays
Authors:
- Rolf H. MöhringRMRolf H. Möhring
- Markus W. SchäffterMSMarkus W. Schäffter
- 1 January 1999
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 25 (1) , 23-40
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Non-approximability Results for Scheduling Problems with Minsum Criteria1998
- Scheduling UET-UCT series-parallel graphs on two processorsTheoretical Computer Science, 1996
- Scheduling jobs with communication delays: Using infeasible solutions for approximation1996
- Three, four, five, six, or the complexity of scheduling with communication delaysOperations Research Letters, 1994
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraintsEuropean Journal of Operational Research, 1989
- Computationally Tractable Classes of Ordered Sets1989
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982