A note on minimum-dummy-activities PERT networks

Marian Mrozek

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

  • Volume: 18, Issue: 4, page 415-421
  • ISSN: 0399-0559

How to cite

top

Mrozek, Marian. "A note on minimum-dummy-activities PERT networks." RAIRO - Operations Research - Recherche Opérationnelle 18.4 (1984): 415-421. <http://eudml.org/doc/104864>.

@article{Mrozek1984,
author = {Mrozek, Marian},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {polynomial time algorithm; optimality verification method; network construction; network analysis; arc-dual digraph; minimum-dummy- activities problem; PERT networks; suboptimal algorithms},
language = {eng},
number = {4},
pages = {415-421},
publisher = {EDP-Sciences},
title = {A note on minimum-dummy-activities PERT networks},
url = {http://eudml.org/doc/104864},
volume = {18},
year = {1984},
}

TY - JOUR
AU - Mrozek, Marian
TI - A note on minimum-dummy-activities PERT networks
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1984
PB - EDP-Sciences
VL - 18
IS - 4
SP - 415
EP - 421
LA - eng
KW - polynomial time algorithm; optimality verification method; network construction; network analysis; arc-dual digraph; minimum-dummy- activities problem; PERT networks; suboptimal algorithms
UR - http://eudml.org/doc/104864
ER -

References

top
  1. 1. A. V. AHO, M. R. GAREY and J. D. ULLMAN, The Transitive Reduction of a Directed Graph, S.I.A.M. J. Comp., Vol. 1, 1972, pp. 131-137. Zbl0247.05128MR306032
  2. 2. D. G. CANTOR and B. DIMSDALE, On Direction-Preserving Maps of Graphs, J. Comb. Th., Vol. 6, 1969, pp. 165-176. Zbl0181.51902MR237385
  3. 3. M. HAYES, The Role of Activity Precedence Relationships in Node-Oreinded Net-works, in: Project Planning by Network Analysis, Proc. of the Second International Congress, North-Holland Pub. Comp., Amsterdam, 1969, pp. 128-146. 
  4. 4. M. S. KRISHNAMOORTHY and N. DEO, Complexity of the Minimum-Dummy-Activities Problem in a PERT Network, Networks, Vol. 9, 1979, pp. 189-194. Zbl0414.68018MR546996
  5. 5. M. MROZEK, Generalized Inverse of a Finite Graph, Fund. Informaticae, Vol. IV. 3, 1981, pp. 499-509. Zbl0485.68053MR678007
  6. 6. F. STERBOUL and D. WERTHEIMER, Comment construireun graphe PERT minimal, R.A.I.R.O. Rech. Op., Vol. 14, No. 1, 1980, pp. 85-98. Zbl0477.90028MR609477
  7. 7. M. M. SYSLO, Optimal Constructions of Event-Node Networks, R.A.I.R.O. Rech.Op., Vol. 15, No. 3, 1981, pp. 241-260. Zbl0464.90078MR637195

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.