Technical Papers
Dec 7, 2020

Resource-Constrained Project Scheduling Problem under Multiple Time Constraints

Publication: Journal of Construction Engineering and Management
Volume 147, Issue 2

Abstract

This paper introduces a new practical scheduling problem called the resource-constrained project scheduling problem under multiple time constraints, which involves a duration constraint of activity, temporal constraint, and resource calendar constraint. The duration constraint of the activity exists widely in real-life projects, and it is first proposed as a resource-constrained project scheduling problem in this paper. We prove the defects of the traditional temporal constraint and improve it. The new problem combines three types of time constraints for the first time, which makes it closer to the actual scheduling problem. We developed a constraint programming optimization model for the new problem and used the IBM ILOG CPLEX-CP version 12.9.0 optimizer to solve it. Computational experiments are carried out to show that the CP optimizer is fast and provides a near-optimum solution to the new problem for projects with hundreds of activities within minutes compared to other metaheuristic methods. The results reported in this paper can be used as a benchmark for other researchers to compare and improve. The new problem contributes to developing a practical decision support system for resolving real-life constraints in projects.

Get full access to this article

View all available purchase options and get full access to this article.

Data Availability Statement

Data generated or analyzed during the study are available from the corresponding author by request. Information about the Journal’s data-sharing policy can be found here: http://ascelibrary.org/doi/10.1061/(ASCE)CO.1943-7862.0001263.

Acknowledgments

This work was supported by the Young Scientists Fund of the National Natural Science Foundation of China (Grant No. 71701069).

References

Artigues, C., R. Leus, and F. T. Nobibon. 2013. “Robust optimization for resource-constrained project scheduling with uncertain activity durations.” Flexible Serv. Manuf. J. 25 (1–2): 175–205. https://doi.org/10.1007/s10696-012-9147-2.
ASTM 2020. Standard specification for ready-mixed concrete. ASTM C94/C94M. West Conshohocken, PA: ASTM.
Ballestín, F. 2007. “When it is worthwhile to work with the stochastic RCPSP?” J. Scheduling 10 (3): 153–166. https://doi.org/10.1007/s10951-007-0012-1.
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.
Bettemir, Ö. H., and R. Sonmez. 2015. “Hybrid genetic algorithm with simulated annealing for resource-constrained project scheduling.” J. Manage. Eng. 31 (5): 04014082. https://doi.org/10.1061/(ASCE)ME.1943-5479.0000323.
Bianco, L., and M. Caramia. 2012. “An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations.” Eur. J. Oper. Res. 219 (1): 73–85. https://doi.org/10.1016/j.ejor.2011.12.019.
Bianco, L., M. Caramia, and S. Giordani. 2016. “Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities.” OR Spectr. 38 (2): 405–425. https://doi.org/10.1007/s00291-016-0435-1.
Blazewicz, J., J. K. Lenstra, and A. R. Kan. 1983. “Scheduling subject to resource constraints: Classification and complexity.” Discrete Appl. Math. 5 (1): 11–24.
Bouleimen, K. L. E. I. N., and H. O. U. S. N. I. Lecocq. 2003. “A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.” Eur. J. Oper. Res. 149 (2): 268–281. https://doi.org/10.1016/S0377-2217(02)00761-0.
Bruni, M. E., L. D. P. Pugliese, P. Beraldi, and F. Guerriero. 2017. “An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations.” Omega 71 (Sep): 66–84. https://doi.org/10.1016/j.omega.2016.09.009.
de Azevedo, G. H. I., A. A. Pessoa, and A. Subramanian. 2019. “A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints.” Eur. J. Oper. Res. https://doi.org/10.1016/j.ejor.2019.07.056.
De Reyck, B. 1998. “A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations.” Eur. J. Oper. Res. 111 (1): 152–174. https://doi.org/10.1016/S0377-2217(97)00305-6.
Gather, T., J. Zimmermann, and J. H. Bartels. 2011. “Exact methods for the resource levelling problem.” J. Scheduling 14 (6): 557–569. https://doi.org/10.1007/s10951-010-0207-8.
Harris, P. E. 2016a. Planning and control using microsoft® project 2013 or 2016 and PMBOK® guide. Templestowe, VIC: Eastwood Harris.
Harris, P. E. 2016b. Planning & control using oracle primavera P6 versions 8, 15 & 16 PPM professional. Templestowe, VIC: Eastwood Harris.
Hartmann, S., and D. Briskorn. 2010. “A survey of variants and extensions of the resource-constrained project scheduling problem.” Eur. J. Oper. Res. 207 (1): 1–14. https://doi.org/10.1016/j.ejor.2009.11.005.
Kadri, R. L., and F. F. Boctor. 2018. “An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case.” Eur. J. Oper. Res. 265 (2): 454–462.
Kastor, A., and K. Sirakoulis. 2009. “The effectiveness of resource levelling tools for resource constraint project scheduling problem.” Int. J. Proj. Manage. 27 (5): 493–500. https://doi.org/10.1016/j.ijproman.2008.08.006.
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.
Kumar, M., M. L. Mittal, G. Soni, and D. Joshi. 2019. “A tabu search algorithm for simultaneous selection and scheduling of projects.” In Harmony search and nature inspired optimization algorithms, 1111–1121. Singapore: Springer.
Kumar, N., D. P. Vidyarthi. 2016. “A model for resource-constrained project scheduling using adaptive PSO.” Soft Comput. 20 (4): 1565–1580.
Laborie, P., J. Rogerie, P. Shaw, and P. Vilím. 2018. “IBM ILOG CP optimizer for scheduling.” Constraints 23 (2): 210–250. https://doi.org/10.1007/s10601-018-9281-x.
Laurent, A., L. Deroussi, N. Grangeon, and S. Norre. 2017. “A new extension of the RCPSP in a multi-site context: Mathematical model and metaheuristics.” Comput. Ind. Eng. 112 (Oct): 634–644. https://doi.org/10.1016/j.cie.2017.07.028.
Li, H., and X. 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.
Liu, J., Y. Liu, Y. Shi, and J. Li. 2020. “Solving resource-constrained project scheduling problem via genetic algorithm.” J. Comput. Civil Eng. 34 (2): 04019055. https://doi.org/10.1061/(ASCE)CP.1943-5487.0000874.
Mahure, A., and A. Ranit. 2018. “Project management using primavera P6.” Int. J. Eng. Res. Technol. 241–244.
Muritiba, A. E. F., C. D. Rodrigues, and F. A. da Costa. 2018. “A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem.” Comput. Oper. Res. 92 (Apr): 145–154. https://doi.org/10.1016/j.cor.2018.01.001.
Myszkowski, P. B., Ł. P. Olech, M. Laszczyk, and M. E. Skowroński. 2018. “Hybrid differential evolution and greedy algorithm (DEGR) for solving multi-skill resource-constrained project scheduling problem.” Appl. Soft Comput. 62: 1–14. https://doi.org/10.1016/j.asoc.2017.10.014.
Nemati-Lafmejani, R., H. Davari-Ardakani, and H. Najafzad. 2019. “Multi-mode resource constrained project scheduling and contractor selection: Mathematical formulation and metaheuristic algorithms.” Appl. Soft Comput. 81 (Aug): 105533. https://doi.org/10.1016/j.asoc.2019.105533.
Neumann, K., and C. Schwindt. 1997. “Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production.” Oper.-Res.-Spektrum 19 (3): 205–217. https://doi.org/10.1007/BF01545589.
Neumann, K., C. Schwindt, and J. Zimmermann. 2003. Project scheduling with time windows and scarce resources: Temporal and resource-constrained project scheduling with regular and nonregular objective functions. New York: Springer.
Rose, K. H. 2013. “A guide to the project management body of knowledge (PMBOK® Guide)—Fifth edition.” Project Manage. J. 3 (44): e1.
Schwindt, C. 1998. Generation of resource constrained project scheduling problems subject to temporal constraints. Karlsruhe, Germany: Institut für Wirtschaftstheorie und Operations-Research.
Valls, V., F. Ballestin, and S. Quintanilla. 2008. “A hybrid genetic algorithm for the resource-constrained project scheduling problem.” Eur. J. Oper. Res. 185 (2): 495–508. https://doi.org/10.1016/j.ejor.2006.12.033.
Wang, X., R. Leus, S. Creemers, Q. Chen, and N. Mao. 2018. “A CTMDP-based exact method for RCPSP with uncertain activity durations and rework.” In Proc., Operations Research Proceedings 2017, 559–565. Cham, Switzerland: Springer.
Xiao, J., Z. Wu, X. X. Hong, J. C. Tang, and Y. Tang. 2016. “Integration of electromagnetism with multi-objective evolutionary algorithms for RCPSP.” Eur. J. Oper. Res. 251 (1): 22–35. https://doi.org/10.1016/j.ejor.2015.10.059.
Yeganeh, F. T., and S. H. Zegordi. 2020. “A multi-objective optimization approach to project scheduling with resiliency criteria under uncertain activity duration.” Ann. Oper. Res. 285 (1–2): 161–196. https://doi.org/10.1007/s10479-019-03375-z.
Zamani, R. 2013. “A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem.” Eur. J. Oper. Res. 229 (2): 552–559.
Zhan, J. 1992. “Calendarization of time planning in MPM networks.” Z. 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.

Information & Authors

Information

Published In

Go to Journal of Construction Engineering and Management
Journal of Construction Engineering and Management
Volume 147Issue 2February 2021

History

Received: Jun 12, 2020
Accepted: Sep 15, 2020
Published online: Dec 7, 2020
Published in print: Feb 1, 2021
Discussion open until: May 7, 2021

Permissions

Request permissions for this article.

Authors

Affiliations

Professor, Dept. of Economic Management, North China Electric Power Univ., Hebei 071003, PR China. ORCID: https://orcid.org/0000-0001-6338-2059. Email: [email protected]
Ph.D. Candidate, Dept. of Economic Management, North China Electric Power Univ., Hebei 071003, PR China (corresponding author). ORCID: https://orcid.org/0000-0001-6451-6688. Email: [email protected]

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.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share