Project Resource Input Optimization Problem with Combined Time Constraints Based on Node Network Diagram and Constraint Programming
Publication: Journal of Construction Engineering and Management
Volume 147, Issue 12
Abstract
The traditional resource-constrained project scheduling problem makes the amounts of resource input fixed and ignores the joint effect of multiple time constraints, which may lead to the failure of traditional algorithms. This paper introduces a new practical problem called the resource input optimization problem with combined time constraints (RIOP/CTC), which studies the influence of resource input schemes. The new problem combines three types of time constraints, including precedence relations, resource calendars, and interruptability for the first time, which makes it closer to the actual scheduling problem. We propose a new network diagram called node network diagram and develop an optimization model based on constraint programming (CP) and the technique for order preference by similarity to the ideal solution (TOPSIS). A three-step guideline and an actual project case are provided for schedulers to help them better use the model to solve RIOP/CTC, which also proves the validity of the model. Computational experiments are carried out to show that the CP optimizer is superior to the three common metaheuristic algorithms in solving quality and speed and can provide a near-optimum solution for large-scale scheduling problems in an acceptable time. The proposed model contributes to improving the practical decision system to support the formulation of real-life project resource input schemes, scheduling plans, and employee work plans.
Get full access to this article
View all available purchase options and get full access to this article.
Data Availability Statement
Some or all data, models, or code that support the findings of this study are available from the corresponding author upon reasonable request.
Acknowledgments
This work was supported by the National Natural Science Foundation of China (Grant No. 71701069).
References
Alvarez-Valdes, R., E. Crespo, J. M. Tamarit, and F. Villa. 2008. “GRASP and path relinking for project scheduling under partially renewable resources.” Eur. J. Oper. Res. 189 (3): 1153–1170. https://doi.org/10.1016/j.ejor.2006.06.073.
Bartusch, M., R. H. Möhring, and F. J. Radermacher. 1988. “Scheduling project networks with resource constraints and time windows.” Ann. Oper. Res. 16 (1): 199–240. https://doi.org/10.1007/BF02283745.
Blazewicz, J., J. K. Lenstra, and A. H. G. R. Kan. 1983. “Scheduling subject to resource constraints: Classification and complexity.” Discrete Appl. Math. 5 (1): 11–24. https://doi.org/10.1016/0166-218X(83)90012-4.
Buddhakulsomsiri, J., and D. S. Kim. 2006. “Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting.” Eur. J. Oper. Res. 175 (1): 279–295. https://doi.org/10.1016/j.ejor.2005.04.030.
Cheng, J., J. Fowler, K. Kempf, and S. Mason. 2015. “Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting.” Comput. Oper. Res. 53 (Jan): 275–287. https://doi.org/10.1016/j.cor.2014.04.018.
Cheng, M.-Y., K.-Y. Huang, and M. Hutomo. 2018. “Multiobjective dynamic-guiding PSO for optimizing work shift schedules.” J. Constr. Eng. Manage. 144 (9): 04018089. https://doi.org/10.1061/(ASCE)CO.1943-7862.0001548.
Coelho, J., and M. Vanhoucke. 2020. “Going to the core of hard resource-constrained project scheduling instances.” Comput. Oper. Res. 121 (Sep): 104976. https://doi.org/10.1016/j.cor.2020.104976.
Franck, B., K. Neumann, and C. Schwindt. 2001. “Project scheduling with calendars.” OR Spektrum 23 (3): 325–334. https://doi.org/10.1007/PL00013355.
Hariga, M., and S. M. El-Sayegh. 2011. “Cost optimization model for the multiresource leveling problem with allowed activity splitting.” J. Constr. Eng. Manage. 137 (1): 56–64. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000251.
Jun, D. H., and K. El-Rayes. 2011. “Multiobjective optimization of resource leveling and allocation during construction scheduling.” J. Constr. Eng. Manage. 137 (12): 1080–1088. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000368.
Rose, K. H. 2013. “A guide to the project management body of knowledge (PMBOK guide)—Fifth edition.” Proj. Manage. J. 44 (3): e1.
Kong, F., and D. Dou. 2020. “RCPSP with combined precedence relations and resource calendars.” J. Constr. Eng. Manage. 146 (12): 04020133. https://doi.org/10.1061/(ASCE)CO.1943-7862.0001929.
Kreter, S., J. Rieck, and J. Zimmermann. 2014. “The total adjustment cost problem: Applications, models, and solution algorithms.” J. Scheduling 17 (2): 145–160. https://doi.org/10.1007/s10951-013-0344-y.
Kreter, S., J. Rieck, and J. Zimmermann. 2016. “Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars.” Eur. J. Oper. Res. 251 (2): 387–403. https://doi.org/10.1016/j.ejor.2015.11.021.
Kreter, S., A. Schutt, and P. J. Stuckey. 2017. “Using constraint programming for solving RCPSP/max-cal.” Constraints 22 (3): 432–462. https://doi.org/10.1007/s10601-016-9266-6.
Kreter, S., A. Schutt, P. J. Stuckey, and J. Zimmermann. 2018. “Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems.” Eur. J. Oper. Res. 266 (2): 472–486. https://doi.org/10.1016/j.ejor.2017.10.014.
Li, H. B., and X. B. Dong. 2018. “Multi-mode resource leveling in projects with mode-dependent generalized precedence relations.” Expert Syst. Appl. 97 (May): 193–204. https://doi.org/10.1016/j.eswa.2017.12.030.
Li, H. B., M. Wang, and X. B. Dong. 2019. “Resource leveling in projects with stochastic minimum time lags.” J. Constr. Eng. Manage. 145 (4): 04019015. https://doi.org/10.1061/(ASCE)CO.1943-7862.0001635.
Lu, M., and H.-C. Lam. 2008. “Critical path scheduling under resource calendar constraints.” J. Constr. Eng. Manage. 134 (1): 25–31. https://doi.org/10.1061/(ASCE)0733-9364(2008)134:1(25).
Maghsoudlou, H., B. Afshar-Nadjafi, and S. T. A. Niaki. 2016. “A multi-objective invasive weeds optimization algorithm for solving multi-skill multi-mode resource constrained project scheduling problem.” Comput. Chem. Eng. 88 (May): 157–169. https://doi.org/10.1016/j.compchemeng.2016.02.018.
Markou, C., G. K. Koulinas, and A. P. Vavatsikos. 2017. “Project resources scheduling and leveling using multi-attribute decision models: Models implementation and case study.” Expert Syst. Appl. 77 (Jul): 160–169. https://doi.org/10.1016/j.eswa.2017.01.035.
Menesi, W., B. Golzarpoor, and T. Hegazy. 2013. “Fast and near-optimum schedule optimization for large-scale projects.” J. Constr. Eng. Manage. 139 (9): 1117–1124. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000722.
Menesi, W., and T. Hegazy. 2015. “Multimode resource-constrained scheduling and leveling for practical-size projects.” J. Manage. Eng. 31 (6): 04014092. https://doi.org/10.1061/(ASCE)ME.1943-5479.0000338.
Son, J., and K. G. Mattila. 2004. “Binary resource leveling model: Activity splitting allowed.” J. Constr. Eng. Manage. 130 (6): 887–894. https://doi.org/10.1061/(ASCE)0733-9364(2004)130:6(887).
Sonmez, R., S. Aminbakhsh, and T. Atan. 2020. “Activity uncrashing heuristic with noncritical activity rescheduling method for the discrete time-cost trade-off problem.” J. Constr. Eng. Manage. 146 (8): 04020084. https://doi.org/10.1061/(ASCE)CO.1943-7862.0001870.
Su, Z.-X., H.-Y. Wei, X. Zou, and J.-X. Qi. 2019. “Zero-one formulation for a partial resource-constrained project scheduling problem with generalized precedence relations.” J. Constr. Eng. Manage. 145 (3): 04018142. https://doi.org/10.1061/(ASCE)CO.1943-7862.0001613.
Vanhoucke, M., and J. Coelho. 2019. “Resource-constrained project scheduling with activity splitting and setup times.” Comput. Oper. Res. 109 (Sep): 230–249. https://doi.org/10.1016/j.cor.2019.05.004.
Wang, L., and X.-L. Zheng. 2018. “A knowledge-guided multi-objective fruit fly optimization algorithm for the multi-skill resource constrained project scheduling problem.” Swarm Evol. Comput. 38 (Feb): 54–63. https://doi.org/10.1016/j.swevo.2017.06.001.
Yoon, P. K., C. L. Hwang, and K. Yoon. 1995. Multiple attribute decision making: An introduction (quantitative applications in the social sciences). Thousand Oaks, CA: SAGE.
Zhan, J. 1992. “Calendarization of time planning in MPM networks.” Zeitschrift Für Oper. Res. 36 (5): 423–438.
Zhang, H. 2012. “Ant colony optimization for multimode resource-constrained project scheduling.” J. Manage. Eng. 28 (2): 150–159. https://doi.org/10.1061/(ASCE)ME.1943-5479.0000089.
Zou, X., and L. H. Zhang. 2020. “A constraint programming approach for scheduling repetitive projects with atypical activities considering soft logic.” Autom. Constr. 109 (Jan): 102990. https://doi.org/10.1016/j.autcon.2019.102990.
Information & Authors
Information
Published In
Journal of Construction Engineering and Management
Volume 147 • Issue 12 • December 2021
Copyright
© 2021 American Society of Civil Engineers.
History
Received: Mar 17, 2021
Accepted: Aug 4, 2021
Published online: Sep 16, 2021
Published in print: Dec 1, 2021
Discussion open until: Feb 16, 2022
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.