Knowledge Driven Improved Meme Algorithm for Solving Multi-objective Distributed Green Flexible Job Shop Scheduling Problem

In order to effectively solve the multi-objective distributed flexible job shop scheduling problem aimed at minimizing maximum completion time and total energy consumption, this study proposes a hybrid multi-objective improved meme algorithm, Designed integrated process priority crossover and universal crossover search operators to enhance the comprehensiveness of the search. A variable neighborhood search operator based on disjunction graph and critical block is introduced to improve the convergence performance of the algorithm, Aiming at the goal of reducing total energy consumption, a gradual energy-saving strategy from semi-active decoding to active decoding and then to fully active decoding has been proposed. In order to verify the effectiveness of the proposed algorithm, separation experiments and comparative experiments were designed. By comparing with algorithms proposed by other researchers recently, the experimental results show that the proposed algorithm exhibits superior performance in distributed green flexible job shop scheduling problems, significantly outperforming other compared algorithms.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1145/3745533.3745537
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Knowledge Driven Improved Meme Algorithm for Solving Multi-objective Distributed Green Flexible Job Shop Scheduling Problem

Hangming Ruan, Hongtao Tang
Scheduling and Optimization Algorithms
article

Knowledge Driven Improved Meme Algorithm for Solving Multi-objective Distributed Green Flexible Job Shop Scheduling Problem

Hangming Ruan, Hongtao Tang
article en

Abstract

In order to effectively solve the multi-objective distributed flexible job shop scheduling problem aimed at minimizing maximum completion time and total energy consumption, this study proposes a hybrid multi-objective improved meme algorithm, Designed integrated process priority crossover and universal crossover search operators to enhance the comprehensiveness of the search. A variable neighborhood search operator based on disjunction graph and critical block is introduced to improve the convergence performance of the algorithm, Aiming at the goal of reducing total energy consumption, a gradual energy-saving strategy from semi-active decoding to active decoding and then to fully active decoding has been proposed. In order to verify the effectiveness of the proposed algorithm, separation experiments and comparative experiments were designed. By comparing with algorithms proposed by other researchers recently, the experimental results show that the proposed algorithm exhibits superior performance in distributed green flexible job shop scheduling problems, significantly outperforming other compared algorithms.

Wuhan University of Technology (CN)
Decent work and economic growth
Openalex Percentile: Top 69%
Scheduling and Optimization Algorithms
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.

Knowledge Driven Improved Meme Algorithm for Solving Multi-objective Distributed Green Flexible Job Shop Scheduling Problem — Hangming Ruan, Hongtao Tang · (2025) | TGRS Research Map | TGRS