Scheduling series-parallel orders subject to 0/1-communication delays

Parallel Computing

Volumn 25, Issue 1, 1999, Pages 23-40

  Möhring, Rolf H ^a   Schäffter, Markus W ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b NONE   (Germany)

Author keywords

Scheduling; Series parallel orders; Unit communication delays

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; DATA COMMUNICATION SYSTEMS; POLYNOMIALS; RESPONSE TIME (COMPUTER SYSTEMS); TELECOMMUNICATION TRAFFIC;

SERIES-PARALLEL ORDERS; UNIT COMMUNICATION DELAYS;

PARALLEL PROCESSING SYSTEMS;

EID: 0032672667     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00100-8     Document Type: Article

References (10)

1. P. Chrétienne, A polynomial time algorithm to optimally schedule tasks over an ideal distributed system under tree-like precedence constraints, European J. Oper. Res. 43 (1989) 225-230.
2. P. Chrétienne, C. Picouleau, Scheduling with communication delays: A survey, in: P. Chretienne, E.G. Coffman, J.K. Lenstra (Eds.), Scheduling Theory and its Applications, Wiley, New York, 1995, pp. 65-90.
3. L. Finta, Z. Liu, I. Milis, E. Bampis, Scheduling UET-UCT series-parallel graphs on two processors, Theor. Comp. Sci. 162 (2) (1996) 323-340.
4. J. Valdes, R.E. Tarjan, E.L. Lawler, The recognition of series parallel digraphs, SIAM J. on Comput. 11 (2) (1982) 298-313.
5. J.A. Hoogeveen, J.K. Lenstra, B. Veltman, Three, four, five, six, or the complexity of scheduling with communication delays, Oper. Res. Lett. 16 (1994) 129-137.
6. C. Hanen, A. Munier, An approximation algorithm for scheduling dependent tasks on m processors with small communication delays, IEEE Symposium on Emerging Technologies and Factory Automation, september 1995.
7. R.H. Möhring, M. Schäffter, A.S. Schulz, Scheduling jobs with communication delays: using infeasible solutions for approximation, Algorithms - ESA'96, Fourth Annual European Symposium, Springer-Verlag, Lecture Notes in Computer Science, vol. 1136, 1996, pp. 76-90.
8. R.H. Möhring, Computationally tractable classes of ordered sets, in: I. Rival (Ed.), Algorithms and Order, Nato Advanced Study Institutes Series, Reidel, Dordrecht, 1989, pp. 105-193.
9. R.H. Möhring, M.W. Schäffter, A simple approximation algorithm for scheduling forests with unit processing times and zero-one communication delays, Preprint No.506/1995, Department of Mathematics, University of Technology, Berlin, Germany, 1995.
10. H. Hoogeveen, P. Schuurman, G.J. Woeginger, Non-approximability results for scheduling problems with minsum criteria, In R.E. Bixby, E.A. Boyd, and R.Z. Ríos-Mercado, editors, Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, pages 353-366. Springer-Verlag, Lecture Notes in Computer Science, vol. 1412, 1998.