Aplicación de la búsqueda tabú en la resolución del problema capacitado de lotificación en sistemas de producción multinivel: un estado del arte

In this work, a study of the application of the taboo search for the resolution of the problem of production planning in multilevel systems with capacity restrictions is approached from the literature. This family of problems is classified in the literature as Np-Hard. Relaxation and search strategies, especially Taboo Search, have played a decisive role in the development of alternative solutions for this type of problem, allowing to obtain solutions close to the optimal minimum cost value, in operationally acceptable times. The purpose of this article is to collect, describe and analyze the use and application of taboo search in the solution of the problem of lotification in multilevel production systems. Contemplating the large number of variations of the problem and emphasizing the methodology used and the configuration of the search, it is intended to establish the baseline for the development of new solution algorithms for the lotification problem.

• Autores: Romero-Conrado, Alfonso R.; Coronado-Hernandez, Jairo R.; Visbal Acevedo, Renso Raul
• Tipo de recurso: http://purl.org/coar/resource_type/c_816b
• Fecha de publicación: 2020
• Institución: Corporación Universidad de la Costa
• Repositorio: REDICUC - Repositorio CUC
• Idioma: eng
• OAI Identifier: oai:repositorio.cuc.edu.co:11323/6735
• Acceso en línea: https://hdl.handle.net/11323/6735; http://doi.org/10.17981/bilo.2.1.2020.1; https://repositorio.cuc.edu.co/
• Palabra clave: Taboo search; Lotification; Multilevel system; Capacity restrictions
• Rights: closedAccess
• License: CC0 1.0 Universal