A matheuristic algorithm for multi-objective unrelated parallel machine scheduling problem

Abstract

Machine scheduling problems are one of the basic manufacturing problems. Thus, there are a lot of study in the literature. In most of these studies, the problem is considered as single objective. Although the single objective approach makes it easier to solve problems theoretically, it is often not possible to provide realistic solutions because almost all real-life problems have multi-objective properties. It is aimed to close this gap in the literature by using the multi-objective programming method that emerged as a powerful solution approach. The objectives are minimizing the makespan and minimizing the total tardiness. A matheuristic algorithm is developed for solving the considered problem. The performance of the algorithm is compared with the results of the augmented ϵ-constraint method. With the proposed matheuristic algorithm, both a solution time advantage is obtained and dominant solutions that could not be obtained with the augmented ϵ-constraint method are reached.