Algoritmos de busca local aplicados ao problema integrado de dimensionamento de lotes e programação da produção

Abstract

Lot Size and Scheduling Problems have become a very important literature study theme due to their high aplicability in real industry context. The present work proposes local search approaches as, simulated annealing and tabu search to solve the Synchronized and Integrated Two-Level Lot Size and Scheduling Problem (SITLSP). The proposed methods are evaluated over a set of problem instances and compared with other methods found in literature. A study of different neighborhood approaches is also made for SITLSP.