Critical path in an activity network with time constraints

European Journal of Operational Research

Volumn 100, Issue 1, 1997, Pages 122-133

  Chen, Yen Liang ^a   Rinks, Dan ^b   Tang, Kwei ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Activity network; Critical path; Float time; Longest path; PERT; Time schedule; Time window

Indexed keywords

ALGORITHMS; DECISION THEORY; PERT; PROJECT MANAGEMENT; SCHEDULING;

ACTIVITY NETWORK; FLOAT TIME; LONGEST PATH; TIME SCHEDULE; TIME WINDOW;

CRITICAL PATH ANALYSIS;

EID: 0031193088     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00140-3     Document Type: Article

References (17)

1. Adlakha, V.G., and Kulkarni, V.G. (1989), "A classified bibliography of research on stochastic PERT networks: 1966-1987", INFOR 27, 272-296.
2. Anklesaria, K.P., and Drezner, Z. (1986), "A multivariate approach to estimating the completion time for PERT networks", Journal of the Operational Research Society 37, 811-815.
3. Chae, K.C., and Kim, S. (1990), "Estimating the mean and variance of PERT activity time using likelihood-ratio of the mode and the midpoint", IIE Transactions 22, 198-203.
4. Chen, Y.L., and Tang, K. (1994), "Shortest paths in time-schedule networks", Working Paper, Department of Information Systems and Decision Sciences, Louisiana State University.
5. Cormen, T.H., Leiserson, C.E., and Rivest, R.L. (1992), Introduction to Algorithms, MIT Press/McGraw-Hill, New York, 485-488.
6. Dumas, Y., Desrosiers, J., and Soumis, F. (1991), "The pickup and delivery problem with time windows", European Journal of Operational Research 54, 7-22.
7. Hershaur, J.C., and Nabielsky, G. (1972), "Estimating activity times", Journal of Systems Management 23, 17-21.
8. Kamburowski, J. (1985), "An upper bound on the expected completion time of PERT networks", European Journal of Operational Research 21, 206-212.
9. Keefer, D.L., and Verdini, W.A. (1993), "Better estimation of PERT activity time parameters", Management Science 39, 1086-1091.
10. Magott, J., and Skudlarski, K. (1993), "Estimating the mean completion time of PERT networks with exponentially distributed durations of activities", European Journal of Operational Research 71, 70-79.
11. Nadas, A. (1979), "Probabilistic PERT", IBM Journal of Research and Development 23, 339-347.
12. Robillard, P., and Trahan, M. (1977), "The completion time of PERT networks", Operations Research 25, 15-29.
13. Sculli, D. (1983), "The completion time of PERT networks", Journal of the Operational Research Society 34, 155-158.
14. Solomon, M.M. (1987), "Algorithms for the vehicle routing and scheduling problems with time window constraints", Operations Research 35, 254-265.
15. Soroush, H. (1993), "Risk taking in stochastic PERT networks", European Journal of Operational Research 67, 221-241.
16. Soroush, H.M., (1994), "The most critical path in a PERT network", Journal of the Operational Research Society 45, 287-300.
17. Williams, T.M. (1992), "Criticality in stochastic networks", Journal of the Operational Research Society 43, 353-357.