In this paper we propose a mono-machine lot-scheduling model for a small-scale soft drink plant. The lot sizing decisions and constraints are the usual and the scheduling constraints are based on the Asymmetric Traveling salesman problem. To validate the model, a computational experiment was conducted using instances generated with random data and with real data taken from the literature. The instances were solved by the Branch-and-Cut method included in the CPLEX 10.0 package. The results show that the proposed model captures the main features of the production planning of a mono-machine small-scale soft drink plant. Moreover, under certain circumstances, provides a better production planning than ATSP na Modelagem do Problema de Produção de Bebidas 207 a model from the literature.
Lot sizing; production sequencing; asymmetric traveling salesman problem
