A Two-Phase Meta-Heuristic for Multiobjective Flexible Job Shop Scheduling Problem With Total Energy Consumption Threshold
针对总能耗不超过给定阈值的多目标柔性作业车间调度问题，提出一种结合帝国竞争算法和变邻域搜索的两阶段元启发式算法，以最小化完工时间和总拖期，实验表明该算法性能优越。
Flexible job shop scheduling problem (FJSP) has been extensively considered; however, multiobjective FJSP with energy consumption threshold is seldom investigated, the goal of which is to minimize makespan and total tardiness under the constraint that total energy consumption does not exceed a given threshold. Energy constraint is not always met and the threshold is difficult to be decided in advance. These features make it more difficult to solve the problem. In this paper, a two-phase meta-heuristic (TPM) based on imperialist competitive algorithm (ICA) and variable neighborhood search (VNS) is proposed. In the first phase, the problem is converted into FJSP with makespan, total tardiness and total energy consumption and the new FJSP is solved by an ICA, which uses some new methods to build initial empires and do imperialist competition. In the second phase, new strategies are provided for comparing solutions and updating the nondominated set of the first phase and a VNS is used for the original problem. The current solution of VNS is periodically replaced with member of the set Ω to improve solution quality. An energy consumption threshold is obtained by optimization. Extensive experiments are conducted to test the performance of TPM finally. The computational results show that TPM is a very competitive algorithm for the considered FJSP.