Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/7117
- Title:
- Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem
- Univ Duisburg Essen
- Universidade Federal de Lavras (UFLA)
- Universidade Estadual Paulista (UNESP)
- Universidade Federal de São Carlos (UFSCar)
- 0020-7543
- Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
- FAPESP: 00/02609-2
- CNPq: 303956/2003-8
- CNPq: 522973/95-7
- This paper introduces an evolutionary algorithm as a procedure to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem (SITLSP). This problem can be found in some industrial settings, mainly soft drink companies, where the production process involves two interdependent levels with decisions concerning raw material storage and soft drink bottling. The challenge is to simultaneously determine the lot-sizing and scheduling of raw materials in tanks and soft drinks in bottling lines, where setup costs and times depend on the previous items stored and bottled. A multi-population genetic algorithm approach with a novel representation of solutions for individuals and a hierarchical ternary tree structure for populations is proposed. Computational tests include comparisons with an exact approach for small-to-moderate-sized instances and with real-world production plans provided by a manufacturer.
- 1-Jan-2009
- International Journal of Production Research. Abingdon: Taylor & Francis Ltd, v. 47, n. 11, p. 3097-3119, 2009.
- 3097-3119
- Taylor & Francis Ltd
- lot-sizing and scheduling
- production planning
- combinatorial optimization
- genetic algorithm
- soft drink manufacturing
- http://dx.doi.org/10.1080/00207540701675833
- Acesso restrito
- outro
- http://repositorio.unesp.br/handle/11449/7117
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.