Computing project makespan distributions : Markovian PERT networks revisited
Year of publication: |
2019
|
---|---|
Authors: | Burgelman, Jeroen ; Vanhoucke, Mario |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 103.2019, p. 123-133
|
Subject: | Project scheduling | PERT networks | Markov Chains | Linear algebra | Markov-Kette | Markov chain | Projektmanagement | Project management | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Netzplantechnik | Project network techniques | Unternehmensnetzwerk | Business network | Durchlaufzeit | Lead time | Mathematische Optimierung | Mathematical programming |
-
Resource allocation in multi-class dynamic PERT networks with finite capacity
Yaghoubi, Saeed, (2015)
-
On finding representative non-dominanted points for bi-objective integer network flow problems
Eusébio, Augusto, (2014)
-
A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
Choi, Byung-Cheon, (2015)
- More ...
-
Maximising the weighted number of activity execution modes in project planning
Burgelman, Jeroen, (2018)
-
Project schedule performance under general mode implementation disruptions
Burgelman, Jeroen, (2020)
-
New computational results for the discrete time/cost trade-off problem with time-switch constraints
Vanhoucke, Mario, (2003)
- More ...