Graph Knowledge-Enhanced Iterated Greedy Algorithm for Hybrid Flowshop Scheduling Problem

Graph Knowledge-Enhanced Iterated Greedy Algorithm for Hybrid Flowshop Scheduling Problem

This study presents a graph knowledge-enhanced iterated greedy algorithm that incorporates dual directional decoding strategies, disjunctive graphs, neighborhood structures, and a rapid evaluation method to demonstrate its superior performance for the hybrid flowshop scheduling problem (HFSP). The p...

Full description

Saved in:
Bibliographic Details
Main Authors: Yingli Li, Biao Zhang, Kaipu Wang, Liping Zhang, Zikai Zhang, Yong Wang
Format: Article
Language:English
Published: MDPI AG 2025-07-01
Series:Mathematics
Subjects:
hybrid flow-shop scheduling problem
iterated greedy algorithm
critical paths
neighborhood structure
rapid evaluation method
Online Access:https://www.mdpi.com/2227-7390/13/15/2401
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2227-7390/13/15/2401

Similar Items