Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths
Download full text from publisher
References listed on IDEAS
- Thomas J. Hindelang & John F. Muth, 1979. "A Dynamic Programming Algorithm for Decision CPM Networks," Operations Research, INFORMS, vol. 27(2), pages 225-241, April.
- Golenko-Ginzburg, Dimitri & Gonik, Aharon, 1998. "A heuristic for network project scheduling with random activity durations depending on the resource allocation," International Journal of Production Economics, Elsevier, vol. 55(2), pages 149-162, July.
- Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
- Elmaghraby, S. E. & Ferreira, A. A. & Tavares, L. V., 2000. "Optimal start times under stochastic activity durations," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 153-164, March.
- Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
- R. A. Bowman, 1995. "Efficient Estimation of Arc Criticalities in Stochastic Activity Networks," Management Science, INFORMS, vol. 41(1), pages 58-67, January.
- John M. Burt, Jr. & Mark B. Garman, 1971. "Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis," Management Science, INFORMS, vol. 18(3), pages 207-217, November.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Escudero Bueno, Laureano F. & Garín Martín, María Araceli & Merino Maestre, María & Pérez Sainz de Rozas, Gloria, 2015. "Some experiments on solving multistage stochastic mixed 0-1 programs with time stochastic dominance constraints," BILTOKI BILTOKI;2015-01, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
- Li, Haitao & Womer, Norman K., 2015. "Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 246(1), pages 20-33.
- Bentaha, Mohand Lounes & Battaïa, Olga & Dolgui, Alexandre & Hu, S. Jack, 2015. "Second order conic approximation for disassembly line design with joint probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 247(3), pages 957-967.
- Escudero, Laureano F. & Garín, María Araceli & Merino, María & Pérez, Gloria, 2016. "On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs," European Journal of Operational Research, Elsevier, vol. 249(1), pages 164-176.
More about this item
Keywordsproject management; integer programming; reformulation-linearization technique; chance-constrained programming; sample average approximation;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:56:y:2010:i:10:p:1794-1814. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.