A new mixed integer linear programming model for flexible job shop scheduling problem

In this paper, a mixed integer linear programming (MILP) model is presented to solve the flexible job shop scheduling problem (FJSP). This problem is one of the hardest combinatorial problems. The objective considered is to minimize the makespan. To the best of our knowledge, the MILP model presented by Ozguven et al. [Appl. Math. Model. 43 (0202) 0341] is the best model in the literature and obtains best results for the problem. The computational results show that the model proposed in this paper is superior to the model presented by Ozguven.