Research on iterated greedy algorithms for hybrid flow shop scheduling considering mandatory operations
LI Chexiang
ZHAO Jiaxin
HOU Yaqun
ZHENG Qian
LI Gongsheng
WANG Yuting
Abstract：In-depth research has been conducted on the Hybrid Flow Shop Scheduling Problem(HFSP),establishing a mathematical model aimed at minimizing the makespan.A Mandatory Operations-based It-erated Greedy Algorithm(MOAIG)has been proposed.First,four lemmas related to mandatory opera-tions are presented.Next,a graph space representation for the scheduling sequence is designed.For the multi-stage characteristics of HFSP,local searches are performed on the mandatory operations along the critical path within the graph space to enhance local search efficiency and expand the search space.Then,to increase the flexibility and diversity of disruption operations,a conservative jump disruption strategy is introduced.Finally,through numerical simulations of 576 typical test cases and statistical comparisons with three representative algorithms,the effectiveness and superiority of the proposed accelerated iterative greedy algorithm based on mandatory operations are validated.
Keywords：hybrid flow-shop schedulingmaximum completion timegraph spaceadaptive jump destruc-tionmandatory operationsiterated greedy algorithm
Publication Date：2025-06-25
Online Publishing Date：2026-08-28(First online date of this platform, not the publication date of the document)
Pages：16( 346-361 )