Open shop scheduling with delays
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 5, pp. 439-447. 
@article{ITA_1992__26_5_439_0,
     author = {Rayward-Smith, V. J. and Rebaine, D.},
     title = {Open shop scheduling with delays},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {439--447},
     publisher = {EDP-Sciences},
     volume = {26},
     number = {5},
     year = {1992},
     mrnumber = {1187512},
     zbl = {0766.90043},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1992__26_5_439_0/}
}
TY  - JOUR
AU  - Rayward-Smith, V. J.
AU  - Rebaine, D.
TI  - Open shop scheduling with delays
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1992
SP  - 439
EP  - 447
VL  - 26
IS  - 5
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1992__26_5_439_0/
LA  - en
ID  - ITA_1992__26_5_439_0
ER  - 
%0 Journal Article
%A Rayward-Smith, V. J.
%A Rebaine, D.
%T Open shop scheduling with delays
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1992
%P 439-447
%V 26
%N 5
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1992__26_5_439_0/
%G en
%F ITA_1992__26_5_439_0
Rayward-Smith, V. J.; Rebaine, D. Open shop scheduling with delays. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 5, pp. 439-447. http://archive.numdam.org/item/ITA_1992__26_5_439_0/

T. Gonzalez and S. Sahni, Open Shop Scheduling to Minimize Finish Time, J. A.C.M., 1976, 23, pp. 665-679. | MR | Zbl

J. J. Hwang, Y. C. Chow, F. D. Angers and C. Y. Lee, Scheduling Precedence Graphs in Systems with Interprocessor Communications Times, S.I.A.M. Comput, 1989, 18, pp. 244-257. | MR | Zbl

R. M. Karp, Reducibilities Among Combinational Problems in Complexity of Computer Computations, R. E. MILLER and J. W. THATCHER Eds., Plenum Press, New York, 1972. | MR | Zbl

J. K. Lenstra, Private Communication, cited in M. R. GAREY and D. S. JOHNSON Eds, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. FREEMAN, San Francisco, 1979. | MR

V. J. Rayward-Smith, The complexity of Preemptive Scheduling Given Interprocessor Communication Delays, Inform. Proc. Letters, 1987 a, 25, pp. 123-125. | MR

V. J. Rayward-Smith, UET Scheduling with Unit Inerprocessor Communication Delays, Discrete Appl. Math., 1987 b, 18, pp. 55-71. | MR | Zbl