در این سایت فقط تکه هایی از این مطلب با شماره بندی انتهای صفحه درج می شود که ممکن است هنگام انتقال از فایل ورد به داخل سایت کلمات به هم بریزد یا شکل ها درج نشود

شما می توانید تکه های دیگری از این مطلب را با جستجو در همین سایت بخوانید

ولی برای دانلود فایل اصلی با فرمت ورد حاوی تمامی قسمت ها با منابع کامل

اینجا کلیک کنید

00

00

00

00

00

00

00

00

00

00

00

00

00

00

—.Ľ..AÍ>

JI…S’…..Ä.Ä>
1. planar

4. global bridge
2. convolution 5. local paths

3. plane 6. homomorphic with
Harthly, H.O., and Wortham, A.W., “A Statistical

Theory for PERT Critical Path Analysis,

Management Science, Vol. 12, No. 10, pp. 469-481, 1966.

Ringer, L.J., “Numerical Operators for Statistical PERT Critical Path Analysis,ĺt Management Science, vol. 16, No. 2, pp. 136-143, 1969.
Kulkarni, V.G., and Adlakha, V.G., “Markov and

Markov-Regenerative PERT Network,’t Journal of Operations Research, Vol. 34, No 5, pp. 769-781, 1986.
Martin, J.J., ‘Distribution of the Time Through a Directed, Acyclic Network,ť Operations Research, vol. 13, No. 1, pp. 46-66, 1965.
Dodin, B., “Bounding the Project Completion Time
Distribution in PERT Networks,ť Journal of Operations Research, Vol. 33, No. 4, pp. 826-881, 1985.
Robillard, P., and Trahan, M., “The Completion Time of PERT Networks,tľ Journal of Operations Research, vol. 25, No. 1, pp. 15-29, 1977.
Kleindorfer, G.B., “Bounding Distributions for a Stochastic Acyclic Network,ť Journal of Operations Research, vol. 19, No. 7, pp. 1586-1601, 1977.
Van Slykle, R.M., “Monte Carlo Methods and the PERT Problem,” Operations Research, Vol. 11, No. 5, pp. 839-860, 1963.
sculli, D., “The Completion Times of PERT
55599269882555

Networks, ť Journal of Operations Research Society,

vol. 34, No. 2, pp. 155-158, 1983.
Kamburowski, J., “An Upper Bound on the Expected Completion Time of PERT Networks,ť European Journal of Operational Research Society, vol. 21, No. 2, pp. 206-212, 1985.

Fulkerson, D.R., “Expected Critical Path Lenght in

PERT Networks,ť Operations Research, Vol. 10, No. 6, pp. 808-817, 1962.

Clingen, C.T., “A Modification of Fulkerson’s PERT Algorithm,” Operations Research, Vol. 12, No. 4, pp. 629-632, 1964.
Elmaghraby, S.E., “On the Expected Duration of PERT Type Networks,” Management Science, vol. 13, No. 5, pp. 299-306, 1967.
Robillard, P., and Trahan, M., “Expected

Completion Time in PERT Networks,” Operations Research, vol. 24, No. 1, pp. 177-182, 1976.
Lindsey, J.H., “An Estimate of Expected Critical
Path Length in PERT Networks,” Journal of Operations Research, Vol. 20, No. 4, pp. 800-812, 1972.
Dodin, B.M., ťApproximating the Distribution Function in Stochastic Network,” Computers and Operations Research, Vol. 12, No. 3, pp. 251-264,

1985.
Ord, J.K., “Simple Approximation to the


دیدگاهتان را بنویسید