Multi-objective Flexible Job Shop Scheduling Problem with Energy Consumption Constraint Using Imperialist Competitive Algorithm

摘要

In this paper, multi-objective flexible job shop scheduling problem (MOFJSP) with energy consumption constraint is investigated and a novel imperialist competitive algorithm (ICA) is used to optimize makespan and total tardiness under a constraint that total energy consumption doesn't exceed a given threshold. The flow of ICA consists of two parts. In the first part, a MOFJSP is obtained by adding total energy consumption as objective and optimized, all generated feasible solutions are stored and updated to build a population of the second part; in the second part, the original MOFJSP is solved by starting with the population. New strategies are applied to build initial empires twice to adapt to the two-part structure and imperialist's reinforced search is added. The computational results show that the new approach to constraint is effective and ICA is a very competitive algorithm.