Jul 2026· GECCO Companion· pp. 1-2· 0 citations· 4 references
Computer Science
TL;DR
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.
Abstract
The Flexible Job Shop Scheduling Problem with Worker constraints (FJSSP-W) is a challenging optimization problem that simultaneously coordinates machine assignment, worker allocation, and operation sequencing. This paper proposes a Late Acceptance Hill Climbing (LAHC) metaheuristic to address the FJSSP-W. LAHC uses a single-state trajectory with a history-based acceptance criterion, enabling straightforward parameter tuning and interpretation. Our implementation explores a neighborhood structure comprising machine and worker reassignments, as well as job-sequence permutations, while using a secondary objective of workload balance to break ties in makespan values. Experimental results on the competition's benchmark demonstrate that the proposed LAHC approach is a promising algorithm to address the problem.
Three new beam-search-based heuristics are proposed: the Beam Search Iterative Construction Heuristic (BS-ICH), its CPU-parallel extension Parallel Multi-Strategy Beam Search (PMS-BS), and a GPU-accelerated variants G-PMS-BS.
A. Dabah, Karima Rihane, Hocine Saadi et al.· 0 citations
These findings demonstrate the effectiveness and adaptability of the proposed framework for energy-aware flexible job shop scheduling and show that the BLDMA framework achieves better non-dominated solution sets on the tested instances.
Jia-Yu Liu, Juin-Han Chen, Hai-Yang Liu et al.· International Journal of Ind...· 0 citations
Experimental results show that the improved algorithm achieves an optimal Makespan value of 190 in dynamic disturbance scenarios and exhibits strong robustness, providing an efficient and feasible solution for job shop scheduling in complex production environments.
Jianguo Du, Chengkun Li, Zijie Tang· ITM Web of Conferences· 0 citations
The hybrid flow shop scheduling problem (HFSP) with unrelated parallel machines (UPMs), sequence-dependent setup times (SDSTs), and inter-stage transportation times has recently emerged as a prominent research topic. To address this scheduling problem with the objective of minimizing the maximum completion time (makesp...
This work establishes a polynomial equivalence between JSC and a variant of the resource-constrained job shop problem with unit-capacity resources and proposes a genetic algorithm using permutation-with-repetition encoding and active, non-delay, and hybrid schedule evaluation procedures.
A Adaptive Genetic Algorithm (AGA) is designed to solve the Multi-Objective Flexible Job Shop Green Scheduling Problem (MO-FJGSP), which aims to minimize the makespan, total energy consumption, and total carbon emissions.
Ming-Yue Li, Li-Na Wang, Jun Wang et al.· Journal of Engineering, Proj...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
