Multiprocessor scheduling with communication delays

Blazewicz, 1986, Scheduling multiprocessor tasks to minimize schedule length, IEEE Trans. Comput., C-35, 389, 10.1109/TC.1986.1676781

Blazewicz, 1984, Scheduling independent 2-processor tasks to minimize schedule length, Inform. Process. Lett., 18, 267, 10.1016/0020-0190(84)90006-1

Bokhari, 1981, On the mapping problem, IEEE Trans. Comput., C-30, 207, 10.1109/TC.1981.1675756

Bozoki, 1970, A branch-and-bound algorithm for the continuous-process task shop scheduling problem, AIIE Trans., 2, 246, 10.1080/05695557008974759

Chen, 1988, Scheduling independent jobs on hypercubes, 273

Chen, 1988, Preemptive scheduling of independent jobs on a hypercube, Inform. Process. Lett., 28, 201, 10.1016/0020-0190(88)90209-8

Chrétienne, 1989, A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints, European J. Oper. Res., 43, 225, 10.1016/0377-2217(89)90216-6

J.Y. Colin and P. Chrétienne, C.P.M. scheduling with small communication delays and task duplication, Oper. Res. (1990) to appear.

Du, 1989, Complexity of scheduling parallel task systems, SIAM J. Discrete Math., 2, 473, 10.1137/0402042

Garey, 1979

Graham, 1966, Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45, 1563, 10.1002/j.1538-7305.1966.tb01709.x

Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math., 5, 287, 10.1016/S0167-5060(08)70356-X

van Hoesel, 1990

Hwang, 1989, Scheduling precedence graphs in systems with interprocessor communication times, SIAM J. Comput., 18, 244, 10.1137/0218016

Kim, 1988, A General Approach to Multiprocessor Scheduling

Lawler, 1989, Sequencing and scheduling: algorithms and complexity

Lee, 1988, Multiprocessor scheduling with interprocessor communication delays, Discrete Appl. Math., 20, 141

McNaughton, 1959, Scheduling with deadlines and loss functions, Management Sci., 6, 1, 10.1287/mnsc.6.1.1

Papadimitriou, 1988, Towards an architecture-independent analysis of parallel algorithms, 510

Rayward-Smith, 1987, The complexity of preemptive scheduling given interprocessor communication delays, Inform. Process. Lett., 25, 123, 10.1016/0020-0190(87)90231-6

Rayward-Smith, 1987, UET scheduling with unit interprocessor communication delays, Discrete Appl. Math., 18, 55, 10.1016/0166-218X(87)90042-4

Sarkar, 1989