To cite this paper use one of the standards below:
The Resource-Constrained Project Scheduling Problem (RCPSP) with mandatory breaks brings the modeling closer to everyday real-world situations, such as ergonomic pauses or rest shifts for workers in construction and manufacturing. This dynamic introduces variability in workforce capacity, increasing the complexity of finding a feasible schedule. This paper compares the performance of metaheuristics based on continuous representation: Particle Swarm Optimization (PSO), Cuckoo Search, and three GRASP variants. Solutions are encoded via Random-Keys and decoded in discrete time, with an objective function based on normalized resource idleness. The computational evaluation employs 750 instances with different topological complexities. The results, validated by the Wilcoxon test, indicate the superiority of PSO, due to its efficiency in exploring rugged search landscapes. Cuckoo Search shows intermediate performance, while GRASP exhibits severe stagnation, a behavior suggesting limitations associated with the misalignment between the continuous representation and its discrete local search structure. Additionally, precedence bottlenecks (hourglass effect) increase computational cost, highlighting the impact of these constraints on decoder performance.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper