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...
Saved in:
| 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: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/15/2401 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving the traffic signaling problem using the iterated local search metaheuristic
by: Elvir Misini, et al.
Published: (2025-07-01) -
Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON
by: Sandra Arnaout, et al.
Published: (2024-01-01) -
Greedy algorithms: a review and open problems
by: Andrea García
Published: (2025-02-01) -
Maximizing Nash Social Welfare Based on Greedy Algorithm and Estimation of Distribution Algorithm
by: Weizhi Liao, et al.
Published: (2024-10-01) -
Optimization of Orthogonal Waveform Using Memetic Algorithm with Iterative Greedy Code Search
by: Wanbin Wang, et al.
Published: (2025-02-01)