Metaheurísticas para la programación de producción de la planta de la imprenta de billetes del banco de la república

Abstract This work proposes the investigation and implementation of three metaheuristics that allow solving the job scheduling and sequencing problem of Imprenta de Billetes del Banco de la República, which works under the Hybrid Flowshop with Missinging Operations system with the objective of minim...

Full description

Autores:
Perilla Sánchez, Edward Andrés
Tipo de recurso:
Fecha de publicación:
2021
Institución:
Universidad de los Andes
Repositorio:
Séneca: repositorio Uniandes
Idioma:
spa
OAI Identifier:
oai:repositorio.uniandes.edu.co:1992/51015
Acceso en línea:
http://hdl.handle.net/1992/51015
Palabra clave:
Impresión de billetes de banco
Programación de la producción
Planificación de la producción
Metaheurística
Algoritmos genéticos
Optimización combinatoria
Ingeniería
Rights
openAccess
License
https://repositorio.uniandes.edu.co/static/pdf/aceptacion_uso_es.pdf
Description
Summary:Abstract This work proposes the investigation and implementation of three metaheuristics that allow solving the job scheduling and sequencing problem of Imprenta de Billetes del Banco de la República, which works under the Hybrid Flowshop with Missinging Operations system with the objective of minimizing the total time to complete all the jobs or Makespan, known for being an NP-Hard type problem. For this purpose, we compare the performance of the Simulated Annealing (SA), Greedy Randomized Adaptive Search Procedure (GRASP) and Biased Random-Keys Genetic Algorithm metaheuristics using the same scheduling procedure based on the NEH algorithm. Likewise, computational results are shown with respect to the solutions of an exact model to evaluate its efficiency on 30 randomly generated instances.