Vermeire, GuillaumeVanhoucke, Mario2025-02-242025-02-2420251568-494610.1016/j.asoc.2025.112776https://repository.vlerick.com/handle/20.500.12127/7631The project scheduling problem with skilled resources is heuristically solved. A new resource assignment procedure is presented using fast priority rules. Three sets of priority rules are evaluated for solving multi-skilled scheduling problems. The heuristic obtains new best-known solutions for a benchmark dataset.This research presents a priority rule heuristic approach for the multi-skilled resource-constrained project scheduling problem. The approach is based on a parallel schedule generation scheme which includes a new resource assignment procedure. The scheme combines three types of priority rules in order to schedule activities and assign resources to the skill requirements of these activities. In computational experiments, skill- and resource rule combinations are evaluated and selected based on two metrics using a Pareto Front approach. These rule combinations are then integrated with various activity priority rules after which their solution quality is evaluated. The heuristic approach and the selected rules are then employed to solve all project instances of the MSLIB dataset. It is shown that, on average, the presented approach is able to obtain solutions with a comparable quality to the solution quality of a meta-heuristic procedure from literature. Additionally, new best known solutions are obtained for the MSLIB dataset. The practical applicability of the heuristic is validated by solving empirical project instances.enProject SchedulingMulti-skilled ResourcesPriority RulesHeuristicResource AssignmentApplied Soft Computing1872-968158614