Uma heurística GRASP para o problema de dimensionamento de lotes com múltiplas plantas / A GRASP heuristic for the multi-plant lot sizing problem

AUTOR(ES)
DATA DE PUBLICAÇÃO

2007

RESUMO

The lot sizing problem, which is the aim of this study, considers an environment consisting of multiple independent plants, multiple items and multiple periods. The production environment has limited capacity and the plants can produce the same items. Each plant has its own demand and the lot transfers between the plants are permitted, which involves a certain cost. This problem has as a particular case the parallel machines lot sizing problem. The objective of this dissertation is to propose a heuristic based on the GRASP (Greedy Randomized Adaptive Search Procedures). Furthermore, a path relinking phase is embedded in the GRASP to obtain better performance. To verify the efficiency of the proposed heuristic, its results were compared with the literature as for the multi-plant as for parallel machines problem. Computational tests showed that the proposed heuristic performed better than other literature heuristic concerning the multiplant problem. Concerning the parallel machines, the heuristic is competitive

ASSUNTO(S)

grasp múltiplas plantas parallel machines and combinatorial optimization path relinking dimensionamento de lotes grasp path relinking multi-plant lot sizing máquinas paralelas e otimização combinatória

ACESSO AO ARTIGO

Documentos Relacionados