Skip Content
You are currently on the new version of our website. Access the old version .
ProcessesProcesses
  • This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
  • Article
  • Open Access

31 January 2026

A Q-Learning-Based Adaptive NSGA-II for Fuzzy Distributed Assembly Hybrid Flow Shop Scheduling Problem

,
,
,
and
1
Hubei Key Laboratory of Modern Manufacturing and Quality Engineering, School of Mechanical Engineering, Hubei University of Technology, Wuhan 430068, China
2
College of Computer and Information Engineering, Wuhan Railway Vocational College of Technology, Wuhan 430074, China
3
Hubei Standardization and Quality Institute, Wuhan 430060, China
*
Author to whom correspondence should be addressed.
Processes2026, 14(3), 500;https://doi.org/10.3390/pr14030500 
(registering DOI)
This article belongs to the Section AI-Enabled Process Engineering

Abstract

With the growing emphasis on holistic management throughout the entire product lifecycle, multi-stage production models that integrate distributed manufacturing, transportation, and assembly processes have gradually attracted research attention. However, studies in this area remain relatively scarce. This paper addresses the fuzzy distributed assembly hybrid flow shop scheduling problem (FDAHFSP), comprehensively considering the entire production flow from manufacturing and transportation to final assembly. A mathematical model is first established with the objectives of minimizing the fuzzy total weighted earliness/tardiness and the fuzzy total energy consumption. To effectively solve this problem, a Q-learning-based adaptive NSGA-II (Q-ANSGA) is proposed. The algorithm incorporates a hybrid strategy combining multiple rules to enhance the quality of the initial population. Additionally, a Q-learning-based adaptive parameter adjustment mechanism is designed to dynamically optimize genetic algorithm parameters, thereby improving the algorithm’s search efficiency and convergence performance. Furthermore, eight neighborhood search operators are developed, and an iterative greedy strategy is integrated to guide the local search process. Finally, comprehensive experiments on 45 test instances are conducted to evaluate the effectiveness of each improvement component and the overall performance of Q-ANSGA. Experimental results demonstrate that the proposed algorithm achieves superior performance in solving the FDAHFSP due to its systematic enhancements.

Article Metrics

Citations

Article Access Statistics

Article metric data becomes available approximately 24 hours after publication online.