Preference-Based Multi-Objective Genetic Programming for Energy-Efficient Dynamic Flexible Job Shop Scheduling

Energy-Efficient dynamic flexible job shop scheduling (E-DFJSS) is a valuable real-world combinational optimisation problem. As an important variant of DFJSS, E-DFJSS aims to optimise trade-off between production effectiveness and energy consumption. Genetic Programming (GP) has been successfully used to learn dispatching rules in E-DFJSS. Nevertheless, different users have different preferences on the trade-off between production effectiveness and energy consumption, the studies of preference-based multi-objective optimisation algorithms are limited. These existing related preference-based methods face the issue of premature convergence in the early stage when solving E-DFJSS, which results in insufficient diversity. To address these challenges, we develop a preference-based multi-objective GP approach for E-DFJSS. A fusion r-dominance and achievement scalarising function dominance criterion is embedded into the proposed algorithm to solve E-DFJSS. Experimental results on training and test on three scenarios with four preferences show that the proposed method could improve the effectiveness of learned scheduling heuristics by balancing diversity and convergence of evolutionary progress.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/cec65147.2025.11043041
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

Preference-Based Multi-Objective Genetic Programming for Energy-Efficient Dynamic Flexible Job Shop Scheduling

Zhuoyin Qiao, Yi Mei, Mengjie Zhang, Fangfang Zhang
Scheduling and Optimization Algorithms
article

Preference-Based Multi-Objective Genetic Programming for Energy-Efficient Dynamic Flexible Job Shop Scheduling

Zhuoyin Qiao, Yi Mei, Mengjie Zhang, Fangfang Zhang
article en

Abstract

Energy-Efficient dynamic flexible job shop scheduling (E-DFJSS) is a valuable real-world combinational optimisation problem. As an important variant of DFJSS, E-DFJSS aims to optimise trade-off between production effectiveness and energy consumption. Genetic Programming (GP) has been successfully used to learn dispatching rules in E-DFJSS. Nevertheless, different users have different preferences on the trade-off between production effectiveness and energy consumption, the studies of preference-based multi-objective optimisation algorithms are limited. These existing related preference-based methods face the issue of premature convergence in the early stage when solving E-DFJSS, which results in insufficient diversity. To address these challenges, we develop a preference-based multi-objective GP approach for E-DFJSS. A fusion r-dominance and achievement scalarising function dominance criterion is embedded into the proposed algorithm to solve E-DFJSS. Experimental results on training and test on three scenarios with four preferences show that the proposed method could improve the effectiveness of learned scheduling heuristics by balancing diversity and convergence of evolutionary progress.

Victoria University of Wellington (NZ)
Decent work and economic growth
Openalex Percentile: Top 79%
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.

Preference-Based Multi-Objective Genetic Programming for Energy-Efficient Dynamic Flexible Job Shop Scheduling — Zhuoyin Qiao, Yi Mei, et al. · (2025) | TGRS Research Map | TGRS