Open shop scheduling with delays
Rayward-Smith, V. J. ; Rebaine, D.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992), p. 439-447 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1992-01-01
@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},
     volume = {26},
     year = {1992},
     pages = {439-447},
     mrnumber = {1187512},
     zbl = {0766.90043},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 439-447. http://gdmltest.u-ga.fr/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 429089 | Zbl 0343.68031

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 986664 | Zbl 0677.68026

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 378476 | Zbl 0366.68041

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 519066

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

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