Modeling the problem of multi-objective job shop scheduling based on security and its solution

Job shop scheduling problem is an important branch of combinatorial optimization problems. Many researchers have constructed multi-objective optimization models taking different factors into account, but none of them have considered the security issue. We have taken the continuous process time into account and established a security based multi-objective optimization models for the job shop scheduling problem. An improved hybrid genetic algorithm for the multi-objective model is also proposed in this paper. We compared our proposed genetic algorithm with other algorithms by a large number of data experiments and the performance of the proposed genetic algorithm is verified. © 2016, UK Simulation Society. All rights reserved.