Analysis of relaxations for the multi-item capacitated lot-sizing problem
Annals of Operations Research
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
Computers and Operations Research
Tabu Search
Hybrid heuristics for planning lot setups and sizes
Computers and Industrial Engineering
Using tabu search with ranking candidate list to solve production planning problems with setups
Computers and Industrial Engineering
Lot sizing and sequencing optimisation at an animal-feed plant
Computers and Industrial Engineering
Computers and Operations Research
An algorithm for production planning in a flexible production system
Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
Hi-index | 0.00 |
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.