IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v107y2007i1p164-172.html
   My bibliography  Save this article

Minimal budget for activities chain with chance constrained lead-time

Author

Listed:
  • Laslo, Zohar
  • Gurevich, Gregory

Abstract

No abstract is available for this item.

Suggested Citation

  • Laslo, Zohar & Gurevich, Gregory, 2007. "Minimal budget for activities chain with chance constrained lead-time," International Journal of Production Economics, Elsevier, vol. 107(1), pages 164-172, May.
    • Handle: RePEc:eee:proeco:v:107:y:2007:i:1:p:164-172
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(06)00219-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    2. Golenko-Ginzburg, Dimitri & Gonik, Aharon & Kesler, Shmuel, 1996. "Hierarchical decision-making model for planning and controlling stochastic projects," International Journal of Production Economics, Elsevier, vol. 46(1), pages 39-54, December.
    3. 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.
    4. D. G. Malcolm & J. H. Roseboom & C. E. Clark & W. Fazar, 1959. "Application of a Technique for Research and Development Program Evaluation," Operations Research, INFORMS, vol. 7(5), pages 646-669, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Laslo, Zohar & Gurevich, Gregory & Keren, Baruch, 2009. "Economic distribution of budget among producers for fulfilling orders under delivery chance constraints," International Journal of Production Economics, Elsevier, vol. 122(2), pages 656-662, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    2. Laslo, Zohar & Keren, Baruch & Ilani, Hagai, 2008. "Minimizing task completion time with the execution set method," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1513-1519, June.
    3. Geng, Sunyue & Liu, Sifeng & Fang, Zhigeng & Gao, Su, 2021. "A reliable framework for satellite networks achieving energy requirements," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    4. Zhen Song & Håkan Schunnesson & Mikael Rinne & John Sturgul, 2015. "An Approach to Realizing Process Control for Underground Mining Operations of Mobile Machines," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-17, June.
    5. Hermans, Ben & Leus, Roel & Looy, Bart Van, 2023. "Deciding on scheduling, secrecy, and patenting during the new product development process: The relevance of project planning models," Omega, Elsevier, vol. 116(C).
    6. Agrawal, M. K. & Elmaghraby, S. E. & Herroelen, W. S., 1996. ": A generator of testsets for project activity nets," European Journal of Operational Research, Elsevier, vol. 90(2), pages 376-382, April.
    7. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    8. Hajdu M. & Isaac S., 2016. "Sixty years of project planning: history and future," Organization, Technology and Management in Construction, Sciendo, vol. 8(1), pages 1499-1510, December.
    9. Siqian Shen & J. Cole Smith & Shabbir Ahmed, 2010. "Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths," Management Science, INFORMS, vol. 56(10), pages 1794-1814, October.
    10. Azaron, Amir & Tavakkoli-Moghaddam, Reza, 2007. "Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1186-1200, August.
    11. Gerald G. Brown & W. Matthew Carlyle & Robert C. Harney & Eric M. Skroch & R. Kevin Wood, 2009. "Interdicting a Nuclear-Weapons Project," Operations Research, INFORMS, vol. 57(4), pages 866-877, August.
    12. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    13. Zhao, Mingxuan & Zhou, Jian & Wang, Ke & Pantelous, Athanasios A., 2023. "Project scheduling problem with fuzzy activity durations: A novel operational law based solution framework," European Journal of Operational Research, Elsevier, vol. 306(2), pages 519-534.
    14. Elena Almaraz Luengo & Carlos Gragera, 2023. "Critical Analysis of Beta Random Variable Generation Methods," Mathematics, MDPI, vol. 11(24), pages 1-31, December.
    15. Lee, Heejung & Suh, Hyo-Won, 2008. "Estimating the duration of stochastic workflow for product development process," International Journal of Production Economics, Elsevier, vol. 111(1), pages 105-117, January.
    16. Jorgensen, Trond & Wallace, Stein W., 2000. "Improving project cost estimation by taking into account managerial flexibility," European Journal of Operational Research, Elsevier, vol. 127(2), pages 239-251, December.
    17. Yakhchali, Siamak Haji & Ghodsypour, Seyed Hassan, 2010. "Computing latest starting times of activities in interval-valued networks with minimal time lags," European Journal of Operational Research, Elsevier, vol. 200(3), pages 874-880, February.
    18. Byung-Cheon Choi & Changmuk Kang, 2019. "A linear time–cost tradeoff problem with multiple milestones under a comb graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 341-361, August.
    19. Kamburowski, J., 1997. "New validations of PERT times," Omega, Elsevier, vol. 25(3), pages 323-328, June.
    20. Rostami, Salim & Creemers, Stefan & Leus, Roel, 2024. "Maximizing the net present value of a project under uncertainty: Activity delays and dynamic policies," European Journal of Operational Research, Elsevier, vol. 317(1), pages 16-24.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:eee:proeco:v:107:y:2007:i:1:p:164-172. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.