The results show that CACSA preserves feasibility in all tested scenarios and generally improves baseline CSA performance, with the clearest gains observed in the larger 35-task instances.
Abstract
Production scheduling in industrial settings requires the simultaneous coordination of tasks, machines, operators, and precedence relations under limited resource availability. This study proposes a Constraint-Aware Cuckoo Search Algorithm (CACSA) for resource-constrained production scheduling and makespan minimization. The modification combines CSA exploration with a constraint-aware and operator-aware repair layer that converts continuous Levy-flight perturbations into feasible discrete schedules by selecting admissible machine–operator pairs, respecting precedence relations, and applying local repair-guided refinement within the same computational budget. The experimental section combines instance-level schedule documentation with comparative statistical evaluation. The documented instance set includes Scenarios I-VI and two 35-task variants, while the repeated comparison uses 30 independent runs per method and an equal computational budget for CACSA, baseline CSA, Genetic Algorithm, Particle Swarm Optimization, Differential Evolution, Simulated Annealing, and Ant Colony Optimization. The evaluation reports best, mean, standard deviation, worst makespan, runtime, feasibility rate, lower-bound gaps, and parameter sensitivity. The results show that CACSA preserves feasibility in all tested scenarios and generally improves baseline CSA performance, with the clearest gains observed in the larger 35-task instances. The study therefore positions the proposed CACSA as a practical and reproducible scheduling approach, while distinguishing feasibility, robustness, and comparative dominance as separate empirical claims.
This study proposes an enhanced artificial bee colony algorithm (ENABC) for flexible job shop scheduling with multiple assembly precedence constraints. The objective is to minimize the total penalty cost (TPC), defined as the sum of tardiness, earliness, flow time, and setup costs. ENABC enhances the classical artifici...
Naritsak Tuntitippawan, Watcharapan Sukkerd, W. Songserm et al.· International Journal of Kno...· 0 citations
The multiobjective flexible job shop scheduling problem (MOFJSP) seeks to jointly minimize makespan and maximum machine workload under coupled opera-tion-sequencing and machine-assignment decisions. Although the nondominated sorting genetic algorithm II (NSGA-II) is widely used for the MOFJSP, its performance can be co...
Ying Li, Rui-Shan Deng, Qing Liu et al.· Electronics· 0 citations
Task scheduling in cloud computing is an NP-hard multi-objective problem that requires the simultaneous optimization of makespan, execution cost, and energy consumption. Although individual metaheuristic algorithms can be strong optimizers, they often fail to achieve a reasonable exploration/exploitation balance across...
Batool Hamid· Al-Noor Journal of Engineeri...· 0 citations
Elective surgical scheduling allocates operating rooms and specialized personnel under operational constraints, yet most metaheuristic evaluations rely on synthetic benchmarks. We study a two-stage flexible flow shop with independently assigned rooms for anesthesia preparation and surgery, calibrated with 23,865 valid...
J. Lara, Marcelo Becerra-Rozas, Bady Gana et al.· Biomimetics· 0 citations
Precast component production is an important part of industrialization in construction. However, in actual production, it often faces problems such as high resource occupation, long production cycles, and high delivery costs caused by unreasonable scheduling arrangements. This study proposes a hybrid multi-objective op...