Uma proposta de resolução para o problema de sequenciamento de tarefas em máquinas paralelas considerando desgastes dependentes da sequência

Abstract

Machine scheduling problems consider situations where it is necessary to define the sequence in which a set of jobs is processed in one or more machines to minimize (maximize) an objective function. It is possible to incorporate several restrictions from real applications into the formulations of these problems, including sequence dependent machine deterioration and maintenance events. This work focus on the parallel machine scheduling problem with sequence dependent deteriorating effects to minimize the makespan (RmjSddjCmax). In this problem, job processing results in performance deterioration of the machine for the processing of the following jobs. Specifically, this study considers the problem RmjSdd;MntjCmax, in which maintenance events are considered. We propose two mathematical models based in Mixed Integer Linear Programming. The first one, ADF+, is applied to solve RmjSddjCmax and the second, ADFM, is applied to solve RmjSdd;MntjCmax. We conducted computational tests to evaluate the performance of the proposed models, revealing that they returned the best results, both in quality and in computational time, when compared with approaches from the literature.