You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/72609
Full metadata record
DC FieldValueLanguage
dc.contributor.authorToledo, Claudio Fabiano Motta-
dc.contributor.authorDa Silva Arantes, Márcio-
dc.contributor.authorFrança, Paulo Morelato-
dc.date.accessioned2014-05-27T11:25:58Z-
dc.date.accessioned2016-10-25T18:34:19Z-
dc.date.available2014-05-27T11:25:58Z-
dc.date.available2016-10-25T18:34:19Z-
dc.date.issued2011-08-24-
dc.identifierhttp://dx.doi.org/10.1145/2001576.2001638-
dc.identifier.citationGenetic and Evolutionary Computation Conference, GECCO'11, p. 443-448.-
dc.identifier.urihttp://hdl.handle.net/11449/72609-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/72609-
dc.description.abstractThis 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.extent443-448-
dc.language.isoeng-
dc.sourceScopus-
dc.subjectGenetic algorithm-
dc.subjectIndustrial applications-
dc.subjectReal-world applications-
dc.subjectScheduling-
dc.subjectTabu search-
dc.subjectBottling lines-
dc.subjectComputational results-
dc.subjectLot sizing-
dc.subjectMaterial storages-
dc.subjectProduction process-
dc.subjectReal-world application-
dc.subjectReal-world problem-
dc.subjectScheduling problem-
dc.subjectSoft drink companies-
dc.subjectSoft drinks-
dc.subjectBeverages-
dc.subjectGenetic algorithms-
dc.subjectIntegration-
dc.titleTabu search to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problemen
dc.typeoutro-
dc.contributor.institutionUniversidade de São Paulo (USP)-
dc.contributor.institutionUniversity of Lavras-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationInstitute of Mathematics and Computer Science USP, Av. Trabalhador são-carlense, 400-
dc.description.affiliationDept. of Computer Science University of Lavras, CP 3037, 37200-000 Lavras, MG-
dc.description.affiliationDept. of Mathematics, Statistics and Computation UNESP, CP 266, 19060-900 P. Prudente, SP-
dc.description.affiliationUnespDept. of Mathematics, Statistics and Computation UNESP, CP 266, 19060-900 P. Prudente, SP-
dc.identifier.doi10.1145/2001576.2001638-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofGenetic and Evolutionary Computation Conference, GECCO'11-
dc.identifier.scopus2-s2.0-84860420410-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.