• Computing project makespan distributions: Markovian PERT networks revisited

      Burgelman, Jeroen; Vanhoucke, Mario; Burgelman, Jeroen; Vanhoucke, Mario (Elsevier, 2019)
      This paper analyses the project completion time distribution in a Markovian PERT network. Several techniques to obtain exact or numerical expressions for the project completion time distribution are evaluated, with the underlying assumption that the activity durations are exponentially distributed random variables. We show that some of the methods advocated in the project scheduling literature are unable to solve standard datasets from the literature. We propose a framework to analyse the applicability, accuracy and sensitivity of different methods to compute project makespan distributions. An alternative data generation process is proposed to benchmark the different methods and the influence of project dataset parameters on the obtained results is extensively assessed.
    • Maximising the weighted number of activity execution modes in project planning

      Burgelman, Jeroen; Vanhoucke, Mario; Burgelman, Jeroen; Vanhoucke, Mario (Elsevier, 2018)
      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.