arrow
Return

Multi-objective flexible job shop scheduling based on feature information optimization algorithm

delete2025-07-01
delete0
PRE
AI
Z
Zeyin Guo
L
Lixin Wei *
J
Jinlu Zhang
呼
呼子宇 (Ziyu Hu)
H
Hao Sun
X
Xin Li
DOI:10.1016/j.cor.2025.107027delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Multi-objective optimization methods are increasingly used in job shop scheduling optimization strategies. However, in the design process of multi-objective optimization strategies, a neighborhood search is performed on all solutions in the optimization algorithm, resulting in a time-consuming search. In the algorithm selection process, feature information carried by individuals is often ignored, leading to a lack of targeted guidance ability in the algorithm. To address the limitations of the existing methods, a multi-objective flexible job shop scheduling method based on a feature information optimization algorithm (FIOA) was proposed. First, a framework of multiple group optimization algorithms was applied to construct diverse groups. Subsequently, a representative individual selection strategy was applied to mine individual offspring information and accelerate population convergence. To balance the exploration ability and computational resources of the FIOA, multiple neighborhood search rules were used to improve the utilization rate of individual offspring. In this study, the parameter configuration of the proposed algorithm was calibrated using the Taguchi method. To evaluate the effectiveness and superiority of the FIOA, each improvement of the FIOA algorithm was evaluated. In addition, it was compared with state-of-the-art algorithms in benchmark tests, and the results showed that the FIOA outperformed the other algorithms in solving flexible job shop scheduling.
Keywords:
Flexible job shop scheduling problem
Multi-objective optimization
Feature information selection
Evolutionary optimization algorithm
Variable neighborhood search

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available
Cited Papers

Cited Papers

A DQL-NSGA-III algorithm for solving the flexible job shop dynamic scheduling problem
err2024-03-01
err24
PREAI
errTang, Hongtao; Xiao, Yu; Zhang, Wei; Lei, Deming; Wang, Jing; Xu, Tao
errShare
errSave
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
err2019-05-01
err236
errOAAI
errGao, Kaizhou; Yang, Fajun; Zhou, MengChu; Pan, Quanke; Suganthan, Ponnuthurai Nagaratnam
errShare
errSave
errShare
errSave
An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
err2015-03-11
err81
PREAI
errGao, Kai Zhou; Suganthan, Ponnuthurai Nagaratnam; Pan, Quan Ke; Tasgetiren, Mehmet Fatih
errShare
errSave
researcher View more