EconPapers    
Economics at your fingertips  
 

Q-learning-based multi-objective particle swarm optimization with local search within factories for energy-efficient distributed flow-shop scheduling problem

Wenqiang Zhang (), Huili Geng (), Chen Li (), Mitsuo Gen (), Guohui Zhang () and Miaolei Deng ()
Additional contact information
Wenqiang Zhang: Henan University of Technology
Huili Geng: Henan University of Technology
Chen Li: Henan University of Technology
Mitsuo Gen: Tokyo University of Science
Guohui Zhang: Zhengzhou University of Aeronautics
Miaolei Deng: Henan University of Technology

Journal of Intelligent Manufacturing, 2025, vol. 36, issue 1, No 9, 185-208

Abstract: Abstract Given the increasing severity of ecological issues, sustainable development and green manufacturing have emerged as crucial areas of research and practice. The continuous growth of the globalizing economy has led to the prevalence of distributed manufacturing systems. Distributed flow-shop scheduling problem (DFSP) is a complex NP-hard problem that involves two highly coupled sub-problems: job allocating for factories and job sequencing within factories. This paper proposes an efficient Q-learning-based multi-objective particle swarm optimization (QL-MoPSO) to address the DFSP, with the objectives of minimizing makespan and total energy consumption. The particle swarm optimization (PSO) algorithm has been enhanced by dividing particles into three subgroups, enabling faster convergence to three distinct areas of the Pareto Front (PF). Q-learning guides variable neighborhood search (VNS) as a local search strategy, balancing exploration and exploitation capabilities. To make the algorithm more reasonable and efficient for solving DFSP, multi-objective particle swarm optimization (MoPSO) uses the exchange sequence to update the job sequence vector, crossover and mutation to update the factory assignment vector. Computational experiments demonstrate that the proposed algorithm accelerates convergence and ensures good distribution performance and diversity, outperforming traditional multi-objective evolutionary algorithms.

Keywords: Distributed flow-shop scheduling problem; Energy consumption; Q-learning; Particle swarm optimization; Variable neighborhood search (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10845-023-02227-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joinma:v:36:y:2025:i:1:d:10.1007_s10845-023-02227-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10845

DOI: 10.1007/s10845-023-02227-9

Access Statistics for this article

Journal of Intelligent Manufacturing is currently edited by Andrew Kusiak

More articles in Journal of Intelligent Manufacturing from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:joinma:v:36:y:2025:i:1:d:10.1007_s10845-023-02227-9