Maximising the weighted number of activity execution modes in project planning

•A new project scheduling problem is presented.•Multiple discrete time model formulations are presented.•The scheduling flexibility and the effect of inefficient modes is discussed.•Detailed computational experiments to analyse the solution quality are presented. In multimode resource-constrained pr...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 270; no. 3; pp. 999 - 1013
Main Authors Burgelman, Jeroen, Vanhoucke, Mario
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.11.2018
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:•A new project scheduling problem is presented.•Multiple discrete time model formulations are presented.•The scheduling flexibility and the effect of inefficient modes is discussed.•Detailed computational experiments to analyse the solution quality are presented. 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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2018.04.035