Chapter
Jan 25, 2024

A Heuristic Algorithm for a Robust Resource-Constrained Project Scheduling Problem with Multi-Skilled Resources

Publication: Computing in Civil Engineering 2023

ABSTRACT

This paper studies a resource-constrained project scheduling problem with stochastic activity durations and multi-skilled resource constraints. Robust project scheduling is employed to tackle uncertainty. We name it the robust resource-constrained project scheduling problem with multi-skilled resources (RRCPSP-MR). The objective is to schedule the starting times of activities and allocate multi-skilled resources reasonably in order to maximize the robustness of the project schedule in the presence of activity duration variability. An optimization model is constructed to formulate this problem. Based on the NP-hardness attribute of the problem, a resource allocation heuristic algorithm is developed to obtain satisfactory solutions. In addition, a demonstration case is executed to show the problem clearly and verify the effectiveness of the proposed model and algorithm. It renders further proof that multi-skilled attributes of resources can improve the robustness of baseline schedules.

Get full access to this article

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

REFERENCES

Arashpour, M., Kamat, V., Bai, Y., Wakefield, R., and Abbasi, B. (2018). “Optimization modeling of multi-skilled resources in prefabrication: Theorizing cost analysis of process integration in off-site construction.” Automat. Constr., 95, 1–9.
Bellenguez-Morineau, O., and Néron, E. (2007). “A branch-and-bound method for solving multi-skill project scheduling problem.” Rairo-Oper. Res., 41(2), 155–170.
Blazewicz, J., Lenstra, J. K., and Kan, A. R. (1983). “Scheduling subject to resource constraints: classification and complexity.” Discrete. Appl. Math., 5(1), 11–24.
Chen, R., Liang, C., Gu, D., and Zhao, H. (2020). “A competence-time-quality scheduling model of multi-skilled staff for IT project portfolio.” Comput. Ind. Eng., 139, 106183.
Davari, M., and Demeulemeester, E. (2019). “Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem.” Ann. Oper. Res., 274, 187–210.
Deblaere, F., Demeulemeester, E., Herroelen, W., and Van de Vonder, S. (2007). “Robust resource allocation decisions in resource-constrained projects.” Decision. Sci., 38(1), 5–37.
Demeulemeester, E., and Herroelen, W. (1992). “A branch-and-bound procedure for the multiple resource-constrained project scheduling problem.” Manage. Sci., 38(12), 1803–1818.
Felberbauer, T., Gutjahr, W. J., and Doerner, K. F. (2019). “Stochastic project management: multiple projects with multi-skilled human resources.” J. Scheduling., 22, 271–288.
Ghamginzadeh, A., Najafi, A. A., and Khalilzadeh, M. (2021). “Multi-objective multi-skill resource-constrained project scheduling problem under time uncertainty.” Int. J. Fuzzy. Syst., 23, 518–534.
Li, Y. Y., Lin, J., and Wang, Z. J. (2022). “Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm.” Appl. Intell., 52(5), 5718–5738.
Liang, Y., Cui, N., Hu, X., and Demeulemeester, E. (2020). “The integration of resource allocation and time buffering for bi-objective robust project scheduling.” Int. J. Prod. Res., 58(13), 3839–3854.
Liang, Y., Cui, N., Wang, T., and Demeulemeester, E. (2019). “Robust resource-constrained max-NPV project scheduling with stochastic activity duration.” Or. Spectrum., 41, 219–254.
Lin, J., Zhu, L., and Gao, K. (2020). “A genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem.” Expert. Syst. Appl., 140, 112915.
Ma, Z., Zheng, W., He, Z., Wang, N., and Hu, X. (2022). “A genetic algorithm for proactive project scheduling with resource transfer times.” Comput. Ind. Eng., 174, 108754.
Pang, N. S., and Meng, Q. C. (2022). “Resource allocation in robust scheduling.” J. Oper. Res. Soc., 1–18.
Polo-Mejía, O., Artigues, C., Lopez, P., Mönch, L., and Basini, V. (2023). “Heuristic and metaheuristic methods for the multi-skill project scheduling problem with partial preemption.” Int. T. Oper. Res., 30(2), 858–891.
Shi, Y., Su, H., and Pang, N. (2021). “Resource flow network generation algorithm in robust project scheduling.” J. Oper. Res. Soc., 72(6), 1294–1308.
Snauwaert, J., and Vanhoucke, M. (2021). “A new algorithm for resource-constrained project scheduling with breadth and depth of skills.” Eur. J. Oper. Res., 292(1), 43–59.
Snauwaert, J., and Vanhoucke, M. (2022). “Mathematical formulations for project scheduling problems with categorical and hierarchical skills.” Comput. Ind. Eng., 169, 108147.
Van de Vonder, S., Demeulemeester, E., and Herroelen, W. (2008). “Proactive heuristic procedures for robust project scheduling: An experimental analysis.” Eur. J. Oper. Res., 189(3), 723–733.

Information & Authors

Information

Published In

Go to Computing in Civil Engineering 2023
Computing in Civil Engineering 2023
Pages: 154 - 162

History

Published online: Jan 25, 2024

Permissions

Request permissions for this article.

ASCE Technical Topics:

Authors

Affiliations

1Ph.D. Candidate, School of Economics and Management, Beihang Univ., Beijing, China. Email: [email protected]
Zhe Xu, Ph.D. [email protected]
2Professor, School of Economics and Management, Beihang Univ., Beijing, China. ORCID: https://orcid.org/0000-0002-7342-6964. Email: [email protected]
Ming Lu, Ph.D., M.ASCE [email protected]
3Professor, Dept. of Civil and Environmental Engineering, Univ. of Alberta, Edmonton, AB, Canada. 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.

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 Paper
$35.00
Add to cart
Buy E-book
$164.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 Paper
$35.00
Add to cart
Buy E-book
$164.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share