.png){kind=icon}
返回
The preemptive stochastic resource-constrained project scheduling problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2019.02.030.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Preemption (or the splitting of activities) is a common practice in many project environments, and has been a standard feature of commercial project management software packages for years. Despite its prevalence in daily practice, preemption has received little attention in the project scheduling literature. A possible explanation for this lack of research interest is the common assumption that preemption only has a limited impact on the optimal makespan of a project. In this article, however, we show that the benefit of preemption can be significant, and that it increases with the size and the complexity of the project network. In addition, we also investigate how activity duration variability impacts the benefits of preemption. To this end, we study the preemptive stochastic resource-constrained project scheduling problem (PSRCPSP), and present an exact solution procedure. Even though the deterministic preemptive resource-constrained project scheduling problem (PRCPSP) has received some attention in the literature, we are the first to study the PSRCPSP. We use hypoexponential distributions to model the activity durations, and define a new continuous-time Markov chain (CTMC) that drastically reduces memory requirements when compared to the well-known CTMC of Kulkarni and Adlakha (1986) (Operations Research, 34(5), 769-781). In addition, we also propose a new and efficient approach to structure the state space of the CTMC. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Project scheduling
Resource constraints
Preemption
Stochastic durations
Continuous-time Markov chain
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
查看更多内容