IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v270y2018i3p999-1013.html
   My bibliography  Save this article

Maximising the weighted number of activity execution modes in project planning

Author

Listed:
  • Burgelman, Jeroen
  • Vanhoucke, Mario

Abstract

In multimode resource-constrained project scheduling, activity modes are selected and activity start times are determined to minimise the project makespan subject to resource constraints. When disruptions occur during project execution delays to project activities may ensue. Therefore, the a priori selected modes restrict the options to adapt the project schedule given the deadline. During the project scheduling phase, information on the best execution mode to include in the baseline schedule for each activity is usually not available. Scheduling these projects requires decisions on the modes to incorporate in the solution to maximise the flexibility during project execution and to postpone the decision on how to implement the activity until more information is available. In this paper, we study a project scheduling problem with multiple execution alternatives. Our objective is to maximise the weighted number of alternative activity execution modes in the project solution under three different assumptions. The research is motivated by real-life project scheduling applications, where the activities to be planned are known in advance, but the execution of these activities is subject to uncertainty. We present a problem description and three mathematical formulations. Additionally, computational results on the efficiency of the formulations and the increased flexibility are reported.

Suggested Citation

  • Burgelman, Jeroen & Vanhoucke, Mario, 2018. "Maximising the weighted number of activity execution modes in project planning," European Journal of Operational Research, Elsevier, vol. 270(3), pages 999-1013.
  • Handle: RePEc:eee:ejores:v:270:y:2018:i:3:p:999-1013
    DOI: 10.1016/j.ejor.2018.04.035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718303382
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2018.04.035?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. Guopeng Song & Tamás Kis & Roel Leus, 2021. "Polyhedral Results and Branch-and-Cut for the Resource Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 105-119, January.

    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:ejores:v:270:y:2018:i:3:p:999-1013. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.