Tabu Search to Solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem

dc.contributorUniversidade de São Paulo (USP)
dc.contributorUniv Lavras
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2020-12-10T19:31:18Z
dc.date.accessioned2022-12-19T20:12:01Z
dc.date.available2020-12-10T19:31:18Z
dc.date.available2022-12-19T20:12:01Z
dc.date.created2020-12-10T19:31:18Z
dc.date.issued2011-01-01
dc.identifierGecco-2011: Proceedings Of The 13th Annual Genetic And Evolutionary Computation Conference. New York: Assoc Computing Machinery, p. 443-448, 2011.
dc.identifierhttp://hdl.handle.net/11449/196037
dc.identifierWOS:000322137100056
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5376674
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.
dc.languageeng
dc.publisherAssoc Computing Machinery
dc.relationGecco-2011: Proceedings Of The 13th Annual Genetic And Evolutionary Computation Conference
dc.sourceWeb of Science
dc.subjectTabu search
dc.subjectgenetic algorithm
dc.subjectscheduling
dc.subjectreal-world applications
dc.subjectindustrial applications
dc.titleTabu Search to Solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución