Tabu search to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
27/05/2014
27/05/2014
24/08/2011
|
Resumo |
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. |
Formato |
443-448 |
Identificador |
http://dx.doi.org/10.1145/2001576.2001638 Genetic and Evolutionary Computation Conference, GECCO'11, p. 443-448. http://hdl.handle.net/11449/72609 10.1145/2001576.2001638 2-s2.0-84860420410 |
Idioma(s) |
eng |
Relação |
Genetic and Evolutionary Computation Conference, GECCO'11 |
Direitos |
closedAccess |
Palavras-Chave | #Genetic algorithm #Industrial applications #Real-world applications #Scheduling #Tabu search #Bottling lines #Computational results #Lot sizing #Material storages #Production process #Real-world application #Real-world problem #Scheduling problem #Soft drink companies #Soft drinks #Beverages #Genetic algorithms #Integration |
Tipo |
info:eu-repo/semantics/conferencePaper |