Adaptive Genetic Algorithm Based on Individual Similarity to Solve Multi-Objective Flexible Job-Shop Scheduling Problem
Aiming at the coupling of energy consumption and completion time in flexible job-shop scheduling, this paper took makespan and energy consumption as the optimization objectives, established a scheduling model, and proposed a scheduling strategy based on improved genetic algorithm. Firstly, a hybrid...
Main Authors: | Xu Liang, Yifan Liu, Xiaolin Gu, Ming Huang, Fajun Guo |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9762751/ |
Similar Items
-
A Novel Mechanism for Efficient the Search Optimization of Genetic Algorithm
by: Chen-Fang Tsai, et al.
Published: (2016-01-01) -
Improved Adaptive Non-Dominated Sorting Genetic Algorithm With Elite Strategy for Solving Multi-Objective Flexible Job-Shop Scheduling Problem
by: Xu Liang, et al.
Published: (2021-01-01) -
The RapidIO Routing Strategy Based on the Double-Antibody Group Multi-Objective Artificial Immunity Algorithm
by: Yanming Fu, et al.
Published: (2022-01-01) -
Solving the Flexible Job Shop Scheduling Problem Using a Discrete Improved Grey Wolf Optimization Algorithm
by: Xiaohong Kong, et al.
Published: (2022-11-01) -
Research on Many-Objective Flexible Job Shop Intelligent Scheduling Problem Based on Improved NSGA-III
by: Yanwei Sang, et al.
Published: (2020-01-01)