Track: Production Planning and Management
Abstract
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 the minimization of the makespan. To the best of our knowledge, the MILP model presented by Ozguven et al. [Appl. Math. Model. 34 (2010) 1539] is the best model in the literature and obtains best results for the problem. The computational results show that the mathematical model proposed in this paper is superior to the one presented by Ozguven.