Book
Open access
Jul 2026
A Late Acceptance Hill-Climbing Algorithm for Flexible Job Shop Scheduling Problems with Worker Flexibility
Experimental results demonstrate that the proposed LAHC approach is a promising algorithm to address the FJSSP-W, and explores a neighborhood structure comprising machine and worker reassignments, as well as job-sequence permutations.
Eduard Iorga, Ben Ertugrul, Alexandros Tzanetos
· GECCO Companion · 0 citations