SciELO - Scientific Electronic Library Online

vol.19 número3Localización de paraderos de detención y diseño óptimo de rutas en el transporte de personalMitigación de la corrosión de estructuras enterradas mediante la modificación de suelos índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados




Links relacionados


Ingeniare. Revista chilena de ingeniería

versão On-line ISSN 0718-3305


HERNANDEZ, José Omar; HERNANDEZ, Salvador  e  FLORES, Idalia. Simulated annealing algorithm to solve the economic lot scheduling problem and the basic cycle approach. Ingeniare. Rev. chil. ing. [online]. 2011, vol.19, n.3, pp.473-485. ISSN 0718-3305.

The problem considered is that of scheduling the production of several different items over the same machine with restricted capacity and on a repetitive basis. The problem is NP-hard and there exist several methods for the problem. In this research we worked with Bomberger's basic cycle approach, for which there are reported several solution proposals, among which are found so far only genetic algorithms in regard to the implementation of metaheuristic techniques to solve the problem. We solved Bomberger's classical example problem, applying simulated annealing metaheuristic. The contributions of this research consist on how to obtain bounds for search space of the variables, and a strategy to control the search along the solution space performed by the algorithm. Because this is a first implementation, we tested several values of the parameters. The algorithm achieves the same cost in almost all tests and the algorithm performs better where the ratio http://fbpe/img/ingeniare/v19n3/art15-sigma.jpgis high, improving some of the results reported in the literature.

Palavras-chave : Production; lot scheduling; inventory; heuristics; simulated annealing.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )


Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons