Show simple item record

dc.contributor.authorBurgelman, Jeroen
dc.contributor.authorVanhoucke, Mario
dc.date.accessioned2019-01-18T10:30:45Z
dc.date.available2019-01-18T10:30:45Z
dc.date.issued2019
dc.identifier.issn0305-0548
dc.identifier.doi10.1016/j.cor.2018.10.017
dc.identifier.urihttp://hdl.handle.net/20.500.12127/6124
dc.description.abstractThis 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.
dc.language.isoen
dc.publisherElsevier
dc.subjectProject Scheduling
dc.subjectPERT Networks
dc.subjectMarkov Chains
dc.subjectLinear Algebra
dc.titleComputing project makespan distributions: Markovian PERT networks revisited
dc.identifier.journalComputers and Operations Research
dc.source.volume103
dc.source.issueMarch
dc.source.beginpage123
dc.source.endpage133
dc.contributor.departmentGhent University
vlerick.knowledgedomainOperations & Supply Chain Management
vlerick.typearticleJournal article with impact factor
vlerick.vlerickdepartmentTOM
dc.identifier.vperid58614


Files in this item

Thumbnail
Name:
Publisher version

This item appears in the following Collection(s)

Show simple item record