Finding the critical path in an activity network with time-switch constraints

European Journal of Operational Research

Volumn 120, Issue 3, 2000, Pages 603-613

  Yang, Hsu Hao ^a   Chen, Yen Liang ^b  

^a NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MATHEMATICAL MODELS; POLYNOMIALS; RESOURCE ALLOCATION;

ACTIVITY NETWORKS; POLYNOMIAL TIME ALGORITHMS; TIME-SWITCH CONSTRAINTS;

CRITICAL PATH ANALYSIS;

EID: 0033897639     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00390-7     Document Type: Article

References (17)

1. S.E. Elmaghraby, Activity nets: A guided tour through some recent developments, European Journal of Operational Research 82 (3) (1995) 383-408.
2. K.C. Chae, S. Kim, Estimating the mean and variance of PERT activity time using likelihood-ratio of the mode and the midpoint, IIE Transactions 22 (3) (1990) 198-203.
3. J.C. Hershaur, G. Nabielsky, Estimating activity times, Journal of Systems Management 23 (9) (1972) 17-21.
4. D.L. Keefer, W.A. Verdini, Better estimation of PERT activity time parameters, Management Science 39 (9) (1993) 1086-1091.
5. J. Magott, K. Skudlarski, Estimating the mean completion time of PERT networks with exponentially distributed durations of activities, European Journal of Operational Research 71 (1) (1993) 70-79.
6. A. Nadas, Probabilistic PERT, IBM Journal of Research and Development 23 (3) (1979) 339-347.
7. H. Soroush, Risk taking in stochastic PERT networks, European Journal of Operational Research 67 (2) (1993) 221-241.
8. T.M. Williams, Criticality in stochastic networks, Journal of the Operational Research Society 43 (4) (1992) 353-357.
9. H.M. Soroush, The most critical path in a PERT network, Journal of the Operational Research Society 45 (3) (1994) 287-300.
10. P.K. Anklesaria, Z. Drezner, A multivariate approach to estimating the completion time for PERT networks, Journal of the Operational Research Society 37 (8) (1986) 811-815.
11. J. Kamburowski, An upper bound on the expected completion time of PERT networks, European Journal of Operational Research 21 (2) (1985) 206-212.
12. P. Robillard, M. Trahan, The completion time of PERT networks, Operations Research 25 (2) (1977) 15-29.
13. D. Sculli, The completion time of PERT networks, Journal of the Operational Research Society 34 (2) (1983) 155-158.
14. D. Golenko-Ginzburg, D. Blokh, A generalized activity network model, Journal of the Operational Research Society 48 (4) (1997) 391-400.
15. Chen Y.L., Rinks D., Tang K. Critical path in an activity network with time constraints. European Journal of Operational Research. 100:1997;122-133.
16. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research. 35:1987;254-265.
17. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction To Algorithms, MIT Press, Cambridge, MA, 1992, pp. 485-488.