You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/72609
Title: 
Tabu search to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem
Author(s): 
Institution: 
  • Universidade de São Paulo (USP)
  • University of Lavras
  • Universidade Estadual Paulista (UNESP)
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.
Issue Date: 
24-Aug-2011
Citation: 
Genetic and Evolutionary Computation Conference, GECCO'11, p. 443-448.
Time Duration: 
443-448
Keywords: 
  • 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
Source: 
http://dx.doi.org/10.1145/2001576.2001638
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/72609
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.