Multi-objective flexible job shop scheduling problem with key objectives

Abstract

In this study, multi-objective flexible job shop scheduling problem (FJSP) with sequence-dependent setup times is considered. An imperialist competitive algorithm (ICA)is presented to minimize makespan and total tardiness as key objectives and energy consumption as non-key one. All objectives are first optimized equally and then two key objectives are minimized under the condition that non-key one doesn't exceed a diminishing threshold. Assimilation and imperialist competition are newly implemented. The computational results show the good performance of ICA for the studied FJSP.