153
Views
1
CrossRef citations to date
0
Altmetric
Research Articles

A chance-constrained programming method with credibility measure for solving the multi-skill multi-mode resource-constrained project scheduling problem

, , &
Pages 1090-1106 | Received 10 May 2022, Accepted 14 Aug 2023, Published online: 08 Sep 2023
 

Abstract

This paper addresses a multi-skilled extension of the multi-mode resource-constrained project scheduling problem (MRCPSP) with preemption of activities and generalized precedence relations under uncertainty. The problem is formulated mathematically as a single objective optimization model to minimize the project makespan. Concerning real-world circumstances, amount of non-renewable resources and availability are considered as interval type-2 fuzzy numbers. Therefore, a type-2 fuzzy chance-constrained programming (TFCP) method is developed to tackle the problem. Four unique characteristics are taken into account in this paper concurrently: (i) multi-skilled resources; (ii) renewable and non-renewable resources; (iii) preemptable activities; and (iv) interval type-2 fuzzy parameters. The existence of these practical contributions causes projects schedule, especially construction projects, to be closer to the real-world conditions. The proposed mathematical model is validated and tested on instances from PSPLIB (j12, j16 and j18) and MMLIB (MM50 and MM100) datasets. In this study, the computational results for the first time demonstrate that the number of preemption points depend heavily on fluctuations of non-renewable resources and number of skills. It is also shown that considering multi-skill renewable resources is an effective factor in project makespan. In J20, there were both a four-unit reduction and increase in the number of preemption points achieving by increasing the average amount of available non-renewable resources by 23 units and decreasing it by 22 units, respectively. Additionally, when seven skills of renewable resources were reduced, the number of preemption points increased by seven units. In this problem instance, project is completed within 28 days considering multi-skill renewable resources, whereas the project makespan is reported 33 days without considering them. Various sensitivity analyses are presented to evaluate the proposed mathematical model and the overall solution approach. Comparative analysis is conducted to compare the schedule in crisp and uncertain conditions. Eventually, the importance of considering multi-skill resources in project scheduling is illustrated compared to not considering them.

Availability of data and material

All data generated or analyzed during this research are included in this published article.

Ethics approval

The authors certify that they have no affiliation with or involvement with human participants or animals performed by any of the authors in any organization or entity with any financial or non-financial interest in the subject matter or materials discussed in this paper.

Authors’ contributions

All authors contributed to all parts of this research including Conceptualization; Formal analysis; Resources; Methodology; Supervision; Data collection and investigation; Software; Validation; and Writing–review & editing.

Acknowledgments

The authors would like to thank the Editor-in-Chief, Associate Editor, and anonymous reviewers for their valuable comments on this presentation for remarkable improvement. The authors would also like to express their gratitude to Ms. Fateme Nazeri and Saeed Aramesh for their provision of data, as well as Prof. Tavakkoli-Moghaddam for the final validation of the obtained results.

Disclosure statement

The authors declare that there is no potential conflict of interest for the research, authorship, and/or publication of this paper.

Declaration of interest statement

The authors of this research entitled “A chance-constrained programming method with credibility measure for solving the multi-skill multi-mode resource-constrained project scheduling problem”, whose names are listed immediately below, certify that they have no affiliations with or involvement in any organization or entity with any financial interest (such as honoraria; educational grants; participation in speakers’ bureaus; membership, employment, consultancies, stock ownership, or other equity interest; and expert testimony or patent-licensing arrangements), or non-financial interest (such as personal or professional relationships, affiliations, knowledge or beliefs) in the subject matter or materials discussed in this manuscript.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.