An effective iterative greedy algorithm for distributed blocking flowshop scheduling problem with balanced energy costs criterion
Abstract: Highlights•A mathematical model of an energy-balance DBFSP_SDST is formulated.•An efficient heuristic is presented to generate a high-quality initial solution.•Two different local searches based on the characteristics of the proposed problem are developed.•A learning-based selection variable neighborhood search is designed.•The VNIG shows superior performance compared with four algorithms on 90 instances.
External IDs:dblp:journals/asc/HanHZQLLG22
Loading