IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i1p115-126.html
   My bibliography  Save this article

Proactive and reactive resource-constrained max-NPV project scheduling with random activity duration

Author

Listed:
  • Weibo Zheng
  • Zhengwen He
  • Nengmin Wang
  • Tao Jia

Abstract

This paper addresses the resource-constrained project problem in which activity durations are stochastic variables and the objective is to maximize the net present value of cash flow in the project. First, using the two classical time buffering methods, proactive scheduling optimization models are constructed to generate the robust schedules. Then, two reactive scheduling models with different objectives are proposed to adjust the baseline schedules when disruptions occur during their execution. For the NP-hardness of the studied problem, three heuristic algorithms, including tabu search (TS), variable neighbourhood search (VNS), and a mixed version of VNS and TS, are developed and compared with the multi-start iteration improvement algorithm through a computational experiment conducted on a randomly generated data set. In addition, based on the computational results obtained, the effects of several key parameters on the proactive and reactive scheduling results are analysed, and some managerial insights are obtained. The research in this paper has practical implications for contractors to improve the project profit in an uncertain environment.

Suggested Citation

  • Weibo Zheng & Zhengwen He & Nengmin Wang & Tao Jia, 2018. "Proactive and reactive resource-constrained max-NPV project scheduling with random activity duration," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(1), pages 115-126, January.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:1:p:115-126
    DOI: 10.1057/s41274-017-0198-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41274-017-0198-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-017-0198-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

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


    Cited by:

    1. Peymankar, Mahboobeh & Davari, Morteza & Ranjbar, Mohammad, 2021. "Maximizing the expected net present value in a project with uncertain cash flows," European Journal of Operational Research, Elsevier, vol. 294(2), pages 442-452.
    2. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
    3. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
    4. Xuejun Hu & Jianjiang Wang & Kaijun Leng, 2019. "The Interaction Between Critical Chain Sequencing, Buffer Sizing, and Reactive Actions in a CC/BM Framework," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(03), pages 1-22, June.
    5. Szmerekovsky, Joseph G. & Venkateshan, Prahalad & Simonson, Peter D., 2023. "Project scheduling under the threat of catastrophic disruption," European Journal of Operational Research, Elsevier, vol. 309(2), pages 784-794.
    6. Farnaz Torabi Yeganeh & Seyed Hessameddin Zegordi, 2020. "A multi-objective optimization approach to project scheduling with resiliency criteria under uncertain activity duration," Annals of Operations Research, Springer, vol. 285(1), pages 161-196, February.

    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:taf:tjorxx:v:69:y:2018:i:1:p:115-126. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.