Open shop scheduling with delays

V. J. Rayward-Smith; D. Rebaine

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1992)

  • Volume: 26, Issue: 5, page 439-447
  • ISSN: 0988-3754

How to cite

top

Rayward-Smith, V. J., and Rebaine, D.. "Open shop scheduling with delays." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 26.5 (1992): 439-447. <http://eudml.org/doc/92427>.

@article{Rayward1992,
author = {Rayward-Smith, V. J., Rebaine, D.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {interprocessor delay; open shop; NP-complete; polynomial algorithm},
language = {eng},
number = {5},
pages = {439-447},
publisher = {EDP-Sciences},
title = {Open shop scheduling with delays},
url = {http://eudml.org/doc/92427},
volume = {26},
year = {1992},
}

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
PB - EDP-Sciences
VL - 26
IS - 5
SP - 439
EP - 447
LA - eng
KW - interprocessor delay; open shop; NP-complete; polynomial algorithm
UR - http://eudml.org/doc/92427
ER -

References

top
  1. T. GONZALEZ and S. SAHNI, Open Shop Scheduling to Minimize Finish Time, J. A.C.M., 1976, 23, pp. 665-679. Zbl0343.68031MR429089
  2. 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. Zbl0677.68026MR986664
  3. 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. Zbl0366.68041MR378476
  4. 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. MR519066
  5. V. J. RAYWARD-SMITH, The complexity of Preemptive Scheduling Given Interprocessor Communication Delays, Inform. Proc. Letters, 1987 a, 25, pp. 123-125. MR896154
  6. V. J. RAYWARD-SMITH, UET Scheduling with Unit Inerprocessor Communication Delays, Discrete Appl. Math., 1987 b, 18, pp. 55-71. Zbl0634.90031MR905178

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.