Comment construire un graphe PERT minimal

F. Sterboul; D. Wertheimer

RAIRO - Operations Research - Recherche Opérationnelle (1981)

  • Volume: 15, Issue: 1, page 85-98
  • ISSN: 0399-0559

How to cite

top

Sterboul, F., and Wertheimer, D.. "Comment construire un graphe PERT minimal." RAIRO - Operations Research - Recherche Opérationnelle 15.1 (1981): 85-98. <http://eudml.org/doc/104778>.

@article{Sterboul1981,
author = {Sterboul, F., Wertheimer, D.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {graph construction algorithm; minimal PERT graph; computational efficiency; project scheduling; algorithms},
language = {fre},
number = {1},
pages = {85-98},
publisher = {EDP-Sciences},
title = {Comment construire un graphe PERT minimal},
url = {http://eudml.org/doc/104778},
volume = {15},
year = {1981},
}

TY - JOUR
AU - Sterboul, F.
AU - Wertheimer, D.
TI - Comment construire un graphe PERT minimal
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1981
PB - EDP-Sciences
VL - 15
IS - 1
SP - 85
EP - 98
LA - fre
KW - graph construction algorithm; minimal PERT graph; computational efficiency; project scheduling; algorithms
UR - http://eudml.org/doc/104778
ER -

References

top
  1. 1. D. G. MALCOLM, J. H. ROSEBOOM, C. E. CLARK et W. FAZAR, Application of a Technique for Research and Development Program Evaluation, Operations Research, vol. 10 n° 6, 1962. Zbl1255.90070
  2. 2. C. G. BIGELOW, Bibliography ou Project Planning and Control by Network Analysis, Operations Research, vol. 10, n° 5, 1962. Zbl0106.14106
  3. 3. J. E. KELLEY, Critical Path Planning and Scheduling-Mathematical Basis, Operations Research, vol. 9, n° 3, 1961, p. 296-320. Zbl0098.12103MR143655
  4. 4. M. HAYES, The Role of Activity Precedence Relationships in Node-orientated networks, Project Planning by Network Analysis, North-Holland Publishing Company, Amsterdam, 1969, p.128. 
  5. 5. B. DIMSDALE, Computer Construction of Minimal Project Networks, I.B.M. Systems J., vol. 2, mars 1963, p. 24-36. 
  6. 6. A. C. FISHER, J. S. LIEBMAN et G. L. NEMHAUSER, Computer Construction of Project Networks, Comm. A.C.M., vol. 11, n° 7, juillet 1968. Zbl0169.20301
  7. 7. D. G. CANTOR et B. DIMSDALE, On Direction-Preserving Maps of Graphs, J. Comb. Theor., vol. 6, 1969, p. 165-176. Zbl0181.51902MR237385
  8. 8. M. M. SYSLO, Optimal Constructions of Reversible Digraph, preprint. Zbl0552.90047
  9. 9. B. ROY, Graphes et ordonnancement, Revue française de Recherche opérationnelle, n° 25, 4e trimestre 1962. 

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.