Note sur les problèmes d'ordonnancement PERT aléatoires
Claude Lefèvre; Philippe Laloyaux
RAIRO - Operations Research - Recherche Opérationnelle (1985)
- Volume: 19, Issue: 1, page 27-33
- ISSN: 0399-0559
Access Full Article
top
How to cite
topLefèvre, Claude, and Laloyaux, Philippe. "Note sur les problèmes d'ordonnancement PERT aléatoires." RAIRO - Operations Research - Recherche Opérationnelle 19.1 (1985): 27-33. <http://eudml.org/doc/104868>.
@article{Lefèvre1985,
author = {Lefèvre, Claude, Laloyaux, Philippe},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {stochastic scheduling; maximum of random variables; probabilistic PERT scheduling; approximative method; bounds; expected total duration},
language = {fre},
number = {1},
pages = {27-33},
publisher = {EDP-Sciences},
title = {Note sur les problèmes d'ordonnancement PERT aléatoires},
url = {http://eudml.org/doc/104868},
volume = {19},
year = {1985},
}
TY - JOUR
AU - Lefèvre, Claude
AU - Laloyaux, Philippe
TI - Note sur les problèmes d'ordonnancement PERT aléatoires
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1985
PB - EDP-Sciences
VL - 19
IS - 1
SP - 27
EP - 33
LA - fre
KW - stochastic scheduling; maximum of random variables; probabilistic PERT scheduling; approximative method; bounds; expected total duration
UR - http://eudml.org/doc/104868
ER -
References
top- 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. Zbl0398.62036MR515696
- 2. S. E. ELMAGHRABY, On the Expected Duration of PERT Type Networks, Management Science, vol. 13, n° 5, 1967, p. 229-306. Zbl0158.38303
- 3. S. E. ELMAGHRABY, Activity Networks, John Wiley and Sons, Inc., New York, 1977. Zbl0385.90076
- 4. D. R. FULKERSON, Expected Critical Path Lengths in PERT Networks, Operations Research, vol. 10, n° 6, 1962, p. 808-817. Zbl0124.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. Zbl0139.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. Zbl0241.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. Zbl1255.90070
- 9. J. J. MARTIN, Distribution of Time Through a Directed, Acyclic Network, Operations Research, vol. 13, n° 1, 1965, p. 46-66. Zbl0137.39302MR191650
- 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. Zbl0519.90045
- 11. P. ROBILLARD et M. TRAHAN, Expected Completion Time in PERT Networks, Operations Research, vol. 24, n° 1, 1976, p. 177-182. Zbl0324.90025MR406447
- 12. P. ROBILLARD et M. TRAHAN, The Completion Time of PERT Networks, Operations Research, vol. 25, n° 1, 1977, p. 15-29. Zbl0363.68053
- 13. B. ROY, Algèbre Moderne et Théorie des Graphes, Dunod, Paris, 1970. Zbl0238.90073MR260413
- 14. D. SCULLY, The Completion Time of PERT Networks, J. Operational Research Society, vol. 34, n° 2, 1983, p. 155-158. Zbl0502.90045
- 15. A. W. SHOGAN, Bounding Distributions for a Stochastic PERT Network, Networks, vol. 7, n° 4, 1977, p. 359-381. Zbl0366.94042MR496579
- 16. R. M. VAN SLYKE, Monte Carlo Methods and the PERT Problem, Operations Research, vol. 11, n° 5, 1963, p. 839-860.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.