Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms
This paper studies the distributed blocking flow shop scheduling problem (DBFSP) using metaheuristics.A mixed integer programming model for solving the problem is proposed, and then three versions of the hybrid iterated greedy algorithm (HIG1, HIG2, and HIG3) are developed, combining new belial model the advantages of an iterated greedy algorithm w