Utilize este identificador para citar ou criar um link para este item:
http://acervodigital.unesp.br/handle/11449/72609Registro de metadados completo
| Campo DC | Valor | Idioma |
|---|---|---|
| dc.contributor.author | Toledo, Claudio Fabiano Motta | - |
| dc.contributor.author | Da Silva Arantes, Márcio | - |
| dc.contributor.author | França, Paulo Morelato | - |
| dc.date.accessioned | 2014-05-27T11:25:58Z | - |
| dc.date.accessioned | 2016-10-25T18:34:19Z | - |
| dc.date.available | 2014-05-27T11:25:58Z | - |
| dc.date.available | 2016-10-25T18:34:19Z | - |
| dc.date.issued | 2011-08-24 | - |
| dc.identifier | http://dx.doi.org/10.1145/2001576.2001638 | - |
| dc.identifier.citation | Genetic and Evolutionary Computation Conference, GECCO'11, p. 443-448. | - |
| dc.identifier.uri | http://hdl.handle.net/11449/72609 | - |
| dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/72609 | - |
| dc.description.abstract | This paper proposes a tabu search approach to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem (SITLSP). It is a real-world problem, often found in soft drink companies, where the production process has two integrated levels with decisions concerning raw material storage and soft drink bottling. Lot sizing and scheduling of raw materials in tanks and products in bottling lines must be simultaneously determined. Real data provided by a soft drink company is used to make comparisons with a previous genetic algorithm. Computational results have demonstrated that tabu search outperformed genetic algorithm in all instances. Copyright 2011 ACM. | en |
| dc.format.extent | 443-448 | - |
| dc.language.iso | eng | - |
| dc.source | Scopus | - |
| dc.subject | Genetic algorithm | - |
| dc.subject | Industrial applications | - |
| dc.subject | Real-world applications | - |
| dc.subject | Scheduling | - |
| dc.subject | Tabu search | - |
| dc.subject | Bottling lines | - |
| dc.subject | Computational results | - |
| dc.subject | Lot sizing | - |
| dc.subject | Material storages | - |
| dc.subject | Production process | - |
| dc.subject | Real-world application | - |
| dc.subject | Real-world problem | - |
| dc.subject | Scheduling problem | - |
| dc.subject | Soft drink companies | - |
| dc.subject | Soft drinks | - |
| dc.subject | Beverages | - |
| dc.subject | Genetic algorithms | - |
| dc.subject | Integration | - |
| dc.title | Tabu search to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem | en |
| dc.type | outro | - |
| dc.contributor.institution | Universidade de São Paulo (USP) | - |
| dc.contributor.institution | University of Lavras | - |
| dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
| dc.description.affiliation | Institute of Mathematics and Computer Science USP, Av. Trabalhador são-carlense, 400 | - |
| dc.description.affiliation | Dept. of Computer Science University of Lavras, CP 3037, 37200-000 Lavras, MG | - |
| dc.description.affiliation | Dept. of Mathematics, Statistics and Computation UNESP, CP 266, 19060-900 P. Prudente, SP | - |
| dc.description.affiliationUnesp | Dept. of Mathematics, Statistics and Computation UNESP, CP 266, 19060-900 P. Prudente, SP | - |
| dc.identifier.doi | 10.1145/2001576.2001638 | - |
| dc.rights.accessRights | Acesso restrito | - |
| dc.relation.ispartof | Genetic and Evolutionary Computation Conference, GECCO'11 | - |
| dc.identifier.scopus | 2-s2.0-84860420410 | - |
| Aparece nas coleções: | Artigos, TCCs, Teses e Dissertações da Unesp | |
Não há nenhum arquivo associado com este item.
Itens do Acervo digital da UNESP são protegidos por direitos autorais reservados a menos que seja expresso o contrário.
