A general variable neighbourhood search for multi-skill resource-constrained project scheduling problem with step-deterioration

Dai, Hongliang; Wu, Cheng; Yang, Wucheng; Wang, Yupu

doi:10.1504/ijise.2020.105288

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This algorithm combines three different neighbourhoods with a scheduling model that takes into account multiple modes and employee skills. Dai et al [49] introduced a General VNS aimed at minimizing the maximum completion time under stepdeterioration, while Dai and Cheng [50] proposed a General VNS based Path Relinking algorithm to tackle the MS-RCPSP with multiple restrictions by incorporating a local refinement process and a path relinking framework. In a related work, the same authors (Dai and Cheng [51] presented a General VNS based Memetic Algorithm that integrated a solution recombination operator and a local optimization procedure.…”

Section: Solution Approachesmentioning

confidence: 99%

“…In this section, we highlight the practical relevance of the MS-RCPSP and delve into how this problem has been applied across several industries to solve project scheduling challenges caused by resource limitations. Examples of such applications include construction [79,80], manufacturing [81,82], IT/software development [79,83], supply chain management [49] healthcare [72,84], oil and gas exploration [33], energy and nuclear power [28,74], and defense [85,86]. In the construction industry, which is grappling with resource limitations, several models and algorithms have been developed to address this challenge.…”

Section: Application Areasmentioning

confidence: 99%

See 1 more Smart Citation

The Multi-Skilled Resource-Constrained Project Scheduling Problem: A Systematic Review and an Exploration of Future Landscapes

Bahroun,

As’ad,

Tanash

et al. 2024

Management Systems in Production Engineering

View full text Add to dashboard Cite

The Multi-skilled Resource Constrained Project Scheduling Problem (MS-RCPSP) is a complex and multi-faceted problem that involves scheduling activities whilst considering various resource constraints. These constraints include limited availability of workers, equipment, and materials, with each activity requiring a minimal set of skills to be executed. Furthermore, for a better resemblance to reality, workers/machines are assumed to be multi-skilled/multi-purpose posing another dimension of complexity to the problem. The objective is to minimize project duration, cost, or other relevant criteria while accounting for the inherent resources flexibility. This paper provides a systematic review of the literature pertaining to MS-RCPSP, and an in-depth analysis of 171 papers published between 2000 and 2021 inclusive. The conducted bibliometric analysis identifies the top contributing authors, most influential papers, existing research tendencies, and thematic research topics within the field. In addition, this review highlights different aspects of the MS-RCPSP, spanning the significance of performance measures, solution approaches, application areas, and the incorporation of time constraints. While project completion time, cost, and tardiness are common performance indicators, other measures such as multi-skilled staff assignment and schedule robustness are also deemed important. Although various methods have been employed to solve the MS-RCPSP including exact and approximate approaches, the selection of the most-suited approach depends on the problem’s scale, complexity, and constraints, necessitating careful consideration of each method’s strengths and weaknesses. Interestingly, several studies have jointly addressed resource and time constraints in the context of MS-RCPSP, often considering tardiness, and have proposed different algorithms, models, and metaheuristics to tackle these challenges. This paper clearly highlights research gaps and promising avenues for future research. This work provides valuable insights for project managers to effectively schedule tasks in the presence of multiple flexible resources.

show abstract

Section: Solution Approachesmentioning

confidence: 99%