A Multiform Evolutionary Framework for Multiobjective Fuzzy Flexible Job Shop Scheduling: A Preliminary Study

ABSTRACT The fuzzy flexible job shop scheduling problem (FFJSS) is a challenging NP‐hard problem due to the combined effects of operation sequencing, flexible machine assignment, and fuzzy processing times. Existing multi‐objective evolutionary algorithms mainly emphasize convergence and diversity in the objective space, while often overlooking the structure in the decision space induced by machine flexibility. This paper presents a multiform evolutionary framework for multi‐objective FFJSS by co‐evolving the original task and an auxiliary task with restricted machine choices. The auxiliary task reduces decision‐space complexity and encourages stable scheduling structures, which are implicitly transferred to guide the search on the original task. Experimental results on benchmark instances demonstrate improved convergence and solution quality over representative algorithms. Further analysis shows that high‐quality nondominated solutions tend to assign most operations to the most efficient machines, supporting the effectiveness of the proposed multiform design.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2026-06-28
DOI
https://doi.org/10.1002/cpe.70812
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

A Multiform Evolutionary Framework for Multiobjective Fuzzy Flexible Job Shop Scheduling: A Preliminary Study

Wuzhao Li, Dongqing Xie, Shaojin Geng, Weian Guo et al.
Concurrency and Computation Practice and Experience
Scheduling and Optimization Algorithms
article

A Multiform Evolutionary Framework for Multiobjective Fuzzy Flexible Job Shop Scheduling: A Preliminary Study

Wuzhao Li, Dongqing Xie, Shaojin Geng, Weian Guo, D Li, Qin Zhang, Chen Ni, Qidi Wu, Lei Wang
article en

Abstract

ABSTRACT The fuzzy flexible job shop scheduling problem (FFJSS) is a challenging NP‐hard problem due to the combined effects of operation sequencing, flexible machine assignment, and fuzzy processing times. Existing multi‐objective evolutionary algorithms mainly emphasize convergence and diversity in the objective space, while often overlooking the structure in the decision space induced by machine flexibility. This paper presents a multiform evolutionary framework for multi‐objective FFJSS by co‐evolving the original task and an auxiliary task with restricted machine choices. The auxiliary task reduces decision‐space complexity and encourages stable scheduling structures, which are implicitly transferred to guide the search on the original task. Experimental results on benchmark instances demonstrate improved convergence and solution quality over representative algorithms. Further analysis shows that high‐quality nondominated solutions tend to assign most operations to the most efficient machines, supporting the effectiveness of the proposed multiform design.

Concurrency and Computation Practice and ExperienceVol. 38(13)
Tongji University (CN), Fujian Polytechnic of Information Technology (CN), Wenzhou Polytechnic (CN)
Decent work and economic growth
Openalex Percentile: Top 7%
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.