Research on Multi-Objective Low-Carbon Flexible Job Shop Scheduling Based on Improved NSGA-II

To optimize the production scheduling of a flexible job shop, this paper, based on the NSGA-II algorithm, proposes an adaptive simulated annealing non-dominated sorting genetic algorithm II with enhanced elitism (ASA-NSGA-EE) that establishes a multi-objective flexible job shop scheduling model with the objective functions of minimizing the maximum completion time, processing cost, and carbon emissions generated from processing. The ASA-NSGA-EE algorithm adopts an adaptive crossover and mutation genetic strategy, which dynamically adjusts the crossover and mutation rates based on the evolutionary stage of the population, aiming to reduce the loss of optimal solutions. Additionally, it incorporates the simulated annealing algorithm to optimize the selection strategy by leveraging its cooling characteristics. Furthermore, it improves the elite strategy through incorporating elite selection criteria. Finally, by simulation experiments, the effectiveness of the improved NSGA-II algorithm is validated by comparing it with other algorithms.

Authors

Institutions

Publication Details

Journal
Machines
Published
2024-08-26
DOI
https://doi.org/10.3390/machines12090590
Citations
12
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
4.19

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Multi-Objective Low-Carbon Flexible Job Shop Scheduling Based on Improved NSGA-II

Liye Lv, Yujun Lu, Zheyu Mei
12 citations
Machines
Scheduling and Optimization Algorithms
4.19
article

Research on Multi-Objective Low-Carbon Flexible Job Shop Scheduling Based on Improved NSGA-II

Liye Lv, Yujun Lu, Zheyu Mei
article en
12 citations

Abstract

To optimize the production scheduling of a flexible job shop, this paper, based on the NSGA-II algorithm, proposes an adaptive simulated annealing non-dominated sorting genetic algorithm II with enhanced elitism (ASA-NSGA-EE) that establishes a multi-objective flexible job shop scheduling model with the objective functions of minimizing the maximum completion time, processing cost, and carbon emissions generated from processing. The ASA-NSGA-EE algorithm adopts an adaptive crossover and mutation genetic strategy, which dynamically adjusts the crossover and mutation rates based on the evolutionary stage of the population, aiming to reduce the loss of optimal solutions. Additionally, it incorporates the simulated annealing algorithm to optimize the selection strategy by leveraging its cooling characteristics. Furthermore, it improves the elite strategy through incorporating elite selection criteria. Finally, by simulation experiments, the effectiveness of the improved NSGA-II algorithm is validated by comparing it with other algorithms.

MachinesVol. 12(9)
Zhejiang Sci-Tech University (CN)
Zhejiang Sci-Tech University
Decent work and economic growth
Openalex Percentile: Top 6%
Scheduling and Optimization Algorithms
4.19
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.