Tabu search to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem
Loading...
External sources
External sources
Date
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Association for Computing Machinery (ACM)
Type
Work presented at event
Access right
Acesso aberto
External sources
External sources
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.
Description
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
Language
English
Citation
Genetic and Evolutionary Computation Conference, GECCO'11, p. 443-448.
