Abordagens exata e heurística para o problema de escalonamento em máquinas paralelas idênticas com servidor único de setup

Abstract

Customer expectations, in terms of quality, cost and delivery times of products and/or services, increasingly raise competitiveness in today’s business environment. Therefore, it is importante to use modern concepts of production process management in order to decide the best way to allocate and use available resources. Proper resource management is even more necessary in production environments where productivity is significantly affected by the preparation times and the resources associated with the setup teams. This work adresses the problem of scheduling parallel machines with a common server and sequence-dependent and independente setup times,whose objective is to minimize the makespan. In this case, the common server, which can be a machine, individual or a team, is responsible for performing the setup operations. Therefore, there must be no conflicts while conducting them.Two time-indexed formulations are proposed for the problem, as well as two algorithms based on the metaheuristic iterated local search. Computational experiments were carried out on 150 instances involving up to 100 jobs ranging from 2 to 10 machines. The results obtained suggest that the methods developed were capable of finding highly competitive solutions when compared to those achieved by existing approaches