August 11, 2025MathematicsOpen Access

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

View Full Paper

Ask AI

Bookmark

Superior performance of the algorithm suggests it enhances scheduling efficiency in hybrid flowshop settings, reducing processing time.
Numerical evaluation with well-known benchmarks shows the new algorithm outperformed previous methods on 183 hard instances.
Graph-based neighborhood structures help prioritize impactful operations, promoting better decision-making during searches.
Integration of rapid evaluation techniques enhances the feasibility of exploring promising regions swiftly within limited timeframes.

Authors

Discussion

No takes yet. Share an insight, caveat, or question.

Graph knowledge-enhanced algorithm improves solution space in hybrid flowshop scheduling, suggesting higher efficiency.

Li et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark