Aplicação de metaheurísticas para problemas de sequenciamento com lotes de tarefas

• Autor(a) principal: Jacob, Vinícius Vilar
• Data de Publicação: 2014
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: LOCUS Repositório Institucional da UFV
• Texto Completo: http://locus.ufv.br/handle/123456789/2669
• topic: Algoritmos; Programação heurística; Programação (Matemática); Algorithms; Heuristic programming; Programming (Mathematics); CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO

Many manufacturing processes can be modeled as a scheduling problem. The optimization of these processes is of great interest to the industry since it can result in higher productivity and profitability. Sometimes, batching can be applied to improve the utilization of production resources, leading to efficiency gains in the production process. In this paper, two complex scheduling problems involving con- siderations of batching are addressed. In the first, the formation of a batch is con- ditioned to processing various jobs of the same family consecutively. In this case, there is no setup time between jobs of same batch (family). In the other problem, the batch formation is associated with delivery costs, where batches with many jobs implies low costs of delivery. In the first problem is addressed the single machine scheduling problem with sequence dependent setup times and total tardiness minimization. In the second, the problem addressed is the single machine scheduling problem and minimizing of the total weighted flow time and delivery costs. The aim of this dissertation is to present, discuss and solve these two scheduling problems applying heuristics and to compare the results with those available in the literature. We proposed three heuristics based on metaheuristic Iterated Local Search (ILS) for the first problem. We also proposed a heuristic based on ILS and other based on metaheuristic Iterated Greedy (IG) and a Mixed Integer Linear Programming model (MILP) for the second problem.