Usando o ATSP na modelagem do problema integrado de produ？？o de bebidas

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.