Minimizing the complexity of an activity network

Networks

Volumn 36, Issue 1, 2000, Pages 47-52

  Kamburowski, Jerzy ^a   Michael, David J ^b   Stallmann, Matthias F M ^c  

^a UNIVERSITY OF TOLEDO   (United States)

^b i2 Technologies   (United States)

^c North Carolina State University   (United States)

Author keywords

Activity networks; Dummy arcs; Network complexity index; Series parallel, PERT

Indexed keywords

EID: 0034239625     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200008)36:1<47::AID-NET5>3.0.CO;2-Q     Document Type: Article

References (18)

1. [1] V.G. Adlakha and V.G. Kulkarni, A classified bibliography of research on stochastic PERT networks: 1966-1987. INFOR 27 (1989), 272-296.
2. [2] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, MA, 1974.
3. [3] W.W. Bein, J. Kamburowski, and M.F.M. Stallmann, Optimal reduction of two-terminal directed acyclic graphs, SIAM J Comput 21 (1992), 1112-1129.
4. [4] D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progression, J Symb Comput 9 (1990), 251-280.
5. [5] B. DeReyck and W. Herroelen, On the use of the complexity index as a measure of complexity in activity networks, Eur J Oper Res 91 (1996), 347-366.
6. [6] B. Dodin, Bounding the project completion time distribution in PERT networks, Oper Res 33 (1985), 862-881.
7. [7] S.E. Elmaghraby, "The estimation of some network parameters in the PERT model of activity networks: Review and critique," Advances in Project Scheduling, R. Slowinski and J. Weglarz (Editors), Elsevier, Amsterdam, 1989, pp. 371-432.
8. [8] S.E. Elmaghraby, Resource allocation via dynamic programming in activity networks, Eur J Oper Res 64 (1993), 199-215.
9. [9] L.R. Ford, Jr. and D.R. Fulkerson, Flows in networks, Princeton University Press, Princeton, NJ, 1962.
10. [10] M.B. Garman, More on conditional sampling in the simulation of stochastic networks, Mgmt Sci 19 (1972), 90-95.
11. [11] P. Kall and S.W. Wallace, Stochastic programming, Wiley, New York, 1994.
12. [12] J. Kamburowski, Bounding the distribution of project duration in PERT networks, Oper Res Lett 12 (1992), 17-22.
13. [13] M.S. Krishnamoorthy and N. Deo, Complexity of the minimum-dummy-activities problem in a PERT network. Networks 9 (1979), 189-194.
14. [14] D.J. Michael, Optimal representations of activity networks as directed acyclic graphs, PhD Thesis, Program in Operations Research, North Carolina State University, Raleigh, NC, 1991.
15. [15] D.J. Michael, J. Kamburowski, and M.F.M. Stallmann, On the minimum dummy arc-problem, RAIRO Oper Res 2 (1993), 153-168.
16. [16] M. Mrozek, Transitively reduced and transitively closed event networks, Networks 16 (1989), 331-348.
17. [17] M.M. Syslo, "A graph-theoretic approach to the jump-number problem," Graphs and order, I. Rival (Editor), Reidel, Dordrecht, 1984, pp. 185-215.
18. [18] S.W. Wallace, Bounding the expected time-cost curve for a stochastic PERT network from below, Oper Res Lett 8 (1989), 89-94.