Abstract
Many practical projects incorporate random rework, which leads to a stochastic project network structure. Until now, however, there have been only few works in the literature that have looked into this particular aspect of project planning and scheduling. In this paper, we consider a resource-constrained project scheduling problem (RCPSP) with exponentially distributed activity durations and two types of random rework. A mathematical model is proposed based on a continuous-time Markov decision process (CTMDP) with the objective to minimize the expected project makespan, which is further converted into an equivalent DTMDP with removing the self-transitions. In order to cope with the curse of dimensionality that comes into play upon solving large-scale instances, we examine a decomposition and parallel method that limits the memory usage. In addition, we also analyze the effect of random rework on the expected project makespan and the optimal rework strategy. Finally, a computational experiment is set up to validate the effectiveness of the proposed model and procedures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Herroelen, W., & Leus, R. (2005). Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, 165(2), 289–306. https://doi.org/10.1016/j.ejor.2004.04.002.
Browning, T. R., & Yassine, A. A. (2016). Managing a portfolio of product development projects under resource constraints. Decision Sciences, 47(2), 333–372. https://doi.org/10.1111/deci.12172.
Yassine, A. A., Mostafa, O., & Browning, T. R. (2017). Scheduling multiple, resource-constrained, iterative, product development projects with genetic algorithms. Computers and Industrial Engineering, 107, 39–56. https://doi.org/10.1016/j.cie.2017.03.001.
Luh, P. B., Liu, F., & Moser, B. (1999). Scheduling of design projects with uncertain number of iterations. European Journal of Operational Research, 113(3), 575–592. https://doi.org/10.1016/S0377-2217(98)00027-7.
Creemers, S. (2015). Minimizing the expected makespan of a project with stochastic activity durations under resource constraints. Journal of Scheduling, 18(3), 263–273. https://doi.org/10.1007/s10951-015-0421-5.
Creemers, S., Leus, R., & Lambrecht, M. (2010). Scheduling Markovian PERT networks to maximize the net present value. Operations Research Letters, 38(1), 51–56. https://doi.org/10.1016/j.orl.2009.10.006.
Wang, X., Chen, Q., Mao, N., Chen, X., & Li, Z. (2015). Proactive approach for stochastic RCMPSP based on multi-priority rule combinations. International Journal of Production Research, 53(4), 1098–1110. https://doi.org/10.1080/00207543.2014.946570.
Puterman, M. L. (2005). Markov decision processes: Discrete stochastic dynamic programming. New York: Wiley.
Acknowledgements
This research is jointly supported by the National Natural Science Foundation of China under Contract No. 51505090 and 61573109.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Wang, X., Leus, R., Creemers, S., Chen, Q., Mao, N. (2018). A CTMDP-Based Exact Method for RCPSP with Uncertain Activity Durations and Rework. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_74
Download citation
DOI: https://doi.org/10.1007/978-3-319-89920-6_74
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89919-0
Online ISBN: 978-3-319-89920-6
eBook Packages: Business and ManagementBusiness and Management (R0)