dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorToledo, Claudio Fabiano Motta
dc.creatorDa Silva Arantes, Márcio
dc.creatorFrança, Paulo Morelato
dc.date2014-05-27T11:25:58Z
dc.date2016-10-25T18:34:19Z
dc.date2014-05-27T11:25:58Z
dc.date2016-10-25T18:34:19Z
dc.date2011-08-24
dc.date.accessioned2017-04-06T01:51:52Z
dc.date.available2017-04-06T01:51:52Z
dc.identifierGenetic and Evolutionary Computation Conference, GECCO'11, p. 443-448.
dc.identifierhttp://hdl.handle.net/11449/72609
dc.identifierhttp://acervodigital.unesp.br/handle/11449/72609
dc.identifier10.1145/2001576.2001638
dc.identifier2-s2.0-84860420410
dc.identifierhttp://dx.doi.org/10.1145/2001576.2001638
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/893464
dc.descriptionThis 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.
dc.languageeng
dc.relationGenetic and Evolutionary Computation Conference, GECCO'11
dc.rightsinfo:eu-repo/semantics/closedAccess
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 Problem
dc.typeOtro


Este ítem pertenece a la siguiente institución