An effective two-stage iterated greedy algorithm for distributed flowshop group scheduling problem with setup time
Abstract: Highlights•A mixed-integer linear programming (MILP) model of DFGSP is proposed.•Two rapid evaluations are designed to accelerate the calculation of the objective.•A two-stage iterated greedy algorithm is designed for solving DFGSP.•The cross-factory and inner-factory cooperative strategies are proposed.
External IDs:dblp:journals/eswa/WangHWLGL23
Loading