Note sur les problèmes d'ordonnancement PERT aléatoires
RAIRO - Operations Research - Recherche Opérationnelle, Tome 19 (1985) no. 1, pp. 27-33.
@article{RO_1985__19_1_27_0,
     author = {Lef\`evre, Claude and Laloyaux, Philippe},
     title = {Note sur les probl\`emes d'ordonnancement PERT al\'eatoires},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {27--33},
     publisher = {EDP-Sciences},
     volume = {19},
     number = {1},
     year = {1985},
     zbl = {0568.90048},
     mrnumber = {794637},
     language = {fr},
     url = {http://archive.numdam.org/item/RO_1985__19_1_27_0/}
}
Lefèvre, Claude; Laloyaux, Philippe. Note sur les problèmes d'ordonnancement PERT aléatoires. RAIRO - Operations Research - Recherche Opérationnelle, Tome 19 (1985) no. 1, pp. 27-33. http://archive.numdam.org/item/RO_1985__19_1_27_0/

1. B. C. Arnold et R. A. Groeneveld, Bounds on Expectations of Linear Systematic Statistics Based on Dependent Samples, The Annals of Statistics, vol. 7, n°1, 1979, p. 220-223. | MR 515696 | Zbl 0398.62036

2. S. E. Elmaghraby, On the Expected Duration of PERT Type Networks, Management Science, vol. 13, n° 5, 1967, p. 229-306. | Zbl 0158.38303

3. S. E. Elmaghraby, Activity Networks, John Wiley and Sons, Inc., New York, 1977. | Zbl 0385.90076

4. D. R. Fulkerson, Expected Critical Path Lengths in PERT Networks, Operations Research, vol. 10, n° 6, 1962, p. 808-817. | Zbl 0124.36304

5. H. O. Hartley et A. W. Wortham, A Statistical Theory for PERT Critical Path Analysis, Management Science, vol 12, n° 10, 1966, p. 469-481. | Zbl 0139.13607

6. M. B. Garman, More on Conditional Sampling in the Simulation of Stochastic Networks, Management Science, vol. 19, n° 1, 1972, p. 90-95. | Zbl 0241.90022

7. K. R. Maccrimmon et C. A. Ryavec, An Analytical Study of the PERT Assumptions Operations Research, vol.12, n° 1, 1964, p. 16-37.

8. P. G. Malcolm, J. H. Roseboom, C. E. Clark et W. Fazar, Application of a Technique for Research and Development, Operations Research, vol. 7, n° 5, 1959, p. 646-669.

9. J. J. Martin, Distribution of Time Through a Directed, Acyclic Network, Operations Research, vol. 13, n° 1, 1965, p. 46-66. | MR 191650 | Zbl 0137.39302

10. J. P. Melin, Proposition d'une Solution Approchée pour l'Étude du Maximum de Plusieurs Variables Aléatoires, R.A.I.R.O.-Rech. Op., vol. 17, n° 2, 1983, p. 175-191. | Numdam | Zbl 0519.90045

11. P. Robillard et M. Trahan, Expected Completion Time in PERT Networks, Operations Research, vol. 24, n° 1, 1976, p. 177-182. | MR 406447 | Zbl 0324.90025

12. P. Robillard et M. Trahan, The Completion Time of PERT Networks, Operations Research, vol. 25, n° 1, 1977, p. 15-29. | Zbl 0363.68053

13. B. Roy, Algèbre Moderne et Théorie des Graphes, Dunod, Paris, 1970. | MR 260413

14. D. Scully, The Completion Time of PERT Networks, J. Operational Research Society, vol. 34, n° 2, 1983, p. 155-158. | Zbl 0502.90045

15. A. W. Shogan, Bounding Distributions for a Stochastic PERT Network, Networks, vol. 7, n° 4, 1977, p. 359-381. | MR 496579 | Zbl 0366.94042

16. R. M. Van Slyke, Monte Carlo Methods and the PERT Problem, Operations Research, vol. 11, n° 5, 1963, p. 839-860.