Improved Adaptive Non-Dominated Sorting Genetic Algorithm With Elite Strategy for Solving Multi-Objective Flexible Job-Shop Scheduling Problem

Improved Adaptive Non-Dominated Sorting Genetic Algorithm With Elite Strategy for Solving Multi-Objective Flexible Job-Shop Scheduling Problem

Regarding the complicated flexible job-shop scheduling problem, it is not only required to get optimal solution of the problem but also required to ensure low-carbon and environmental protection. Based on the NSGA-II algorithm, this article proposes an improved adaptive non-dominated sorting genetic...

Full description

Bibliographic Details
Main Authors: Xu Liang, Jiabao Chen, Xiaolin Gu, Ming Huang
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Non-dominated sorting
genetic algorithm
adaptive
job-shop scheduling
Online Access:https://ieeexplore.ieee.org/document/9492149/

Internet

https://ieeexplore.ieee.org/document/9492149/

Similar Items