Um Modelo De Otimização Para O Problema Integrado De Dimensionamento De Lotes E Programação Da Produção Em Fábricas De Refrigerantes

The present paper establishes, describes mathematically and solves a multi-level lot sizing and scheduling problem in an industrial set with parallel machines and sequence-dependent setup cost and time, The problem is motivated by real situations found in some industrial settings mainly the soft drink industry. In this kind of industry, the production involves two interdependent levels with decisions about raw material storage and soft drink bottling, The several raw materials are stored in tanks from which they flow to the bottling lines. The challenge is to determine simultaneously the minimum cost lot sizing and scheduling of raw material in tanks and also in the bottling lines, where setup costs and time depend on the previous items stored and bottled. A mixed-integer mathematical model with several combined constrains that use to be handled apart in the literature is proposed. The lack of similar models led us to create a set of instances to evaluate the model and the solution techniques developed. The instances were optimally solved by the GAMS/Cplex software. Due to the problem complexity, it is demonstrated that the use of this optimization package is only viable for small-sized instances. The computational results are showed and analyzed.271155186Bitran, G.R., Matsuo, H., Approximation formulations for the single-product capacitated lot size problem (1986) Operations Research, 34, pp. 63-74Campbell, G.M., Using short-term dedication for scheduling multiple products on parallel machines (1992) Production and Ope rations Management, 1, pp. 295-307Carreno, J.J., Economic lot scheduling for multiple products on parallel identical processors (1990) Management Science, 36, pp. 348-358Clark, A.R., Clark, S.J., Rolling-horizon lot-sizing when set-up times are sequence-dependent (2000) International Journal of Production Research, 38 (10), pp. 2287-2307De Matta, R., Guignard, M., The performance of rolling production schedules in a process industry (1995) IIE Transactions, 27, pp. 564-573Drexl, A., Haase, K., Proportional lotsizing and scheduling (1995) International Journal of Production Economics, 40, pp. 73-87Drexl, A., Haase, K., Sequential-analysis based randomized-regret-methods for lot-sizing and scheduling (1996) Journal of the Operational Research Society, 47, pp. 251-265Drexl, A., Kimms, A., Lot sizing and scheduling - survey and extensions (1997) European Journal of Operational Research, 99, pp. 221-235Fleischmann, B., The discrete lot-sizing and scheduling problem (1990) European Journal of Operational Research, 44, pp. 337-348Fleischmann, B., The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (1994) European Journal of Operational Research, 75, pp. 395-404Fleischmann, B., Meyr, H., The general lotsizing and scheduling problem (1997) OR Spektrum, 19, pp. 11-21Gupta, D., Magnusson, T., The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (2005) Computer & Operations Research, 32, pp. 727-747Haase, K., Kimms, A., Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities (2000) International Journal of Production Economics, 66, pp. 159-169Kang, S., Malik, K., Thomas, L.J., Lotsizing and scheduling on parallel machines with sequence-dependent setup costs (1999) Management Science, 45, pp. 273-289Karmakar, U.S., Kekre, S., The deterministic lotsizing problem with startup and reservation costs (1987) Operations Research, 35, pp. 389-398Kimms, A., Demand Shuffle - A method for multi-level proportional lot sizing and scheduling (1997) Naval Research Logistics, 44, pp. 319-340Kimms, A., (1997) Multi-level lot sizing and scheduling: Methods for capacitated, dynamic and deterministic models, , Physica-Verlag, HeidelbergKuhn, H., Quadt, D., Lot sizing and scheduling in semiconductor assembly - a hierarchical planning approach (2002) Proceedings of the International Conference on Modeling and Analysis of Semiconductor Manufacturing, pp. 211-216. , edited by G.T. Mackulak, J.W. Fowler and A. Schömig, Tempe, USAMeyr, H., Simultaneous lotsizing and scheduling by combining local search with dual reoptimization (2000) European Journal of Operational Research, 120, pp. 311-326Meyr, H., Simultaneous lotsizing and scheduling on parallel machines (2002) European Journal of Operational Research, 139, pp. 277-292Quadt, D., Kuhn, H., (2003) Production planning in semiconductor assembly, , Working Paper, Catholic University of Eichstätt, IngolstadtStadtler, H., Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing (1996) European Journal of Operational Research, 94, pp. 561-581Tempelmeier, H., Derstroff, A., A lagrangean-based heuristic for dynamic multilevel multi-item constrained lotsizing with setup times (1996) Management Science, 42, pp. 738-757Toledo, C.F.M., (2005), Problema conjunto de dimensionamento de lotes e programação da produção. Tese de Doutorado, Universidade Estadual de Campinas, Faculdade de Engenharia Elétric

Um modelo de otimização para o problema integrado de dimensionamento de lotes e programação da produção em fábricas de refrigerantes

O presente artigo apresenta, modela matematicamente e soluciona um problema multi-nível integrado de dimensionamento de lotes e programação da produção em um ambiente industrial com máquinas paralelas que apresentam restrições de capacidade, custos e tempos de preparo dependentes da seqüência. O problema é motivado pela realidade encontrada em alguns setores industriais, em particular o de fabricação e engarrafamento de bebidas. Nesse tipo de indústria a produção envolve dois níveis interdependentes com decisões relativas à armazenagem das matérias-primas e ao engarrafamento das bebidas. As diversas matérias-primas são armazenadas em tanques de onde escoam para as linhas de engarrafamento. O desafio é determinar simultaneamente o dimensionamento e a programação de custo mínimo das matérias-primas nos tanques e o envasamento de bebidas nas linhas, onde tempos e custos de trocas dependem do tipo de item previamente armazenado e envasado. É proposto um modelo matemático inteiro-misto que introduz diversas restrições combinadas que até então costumavam ser tratadas separadamente na literatura. A não existência de testes com modelos similares nos obrigou a criar um conjunto de instâncias para avaliar o modelo e as técnicas de solução propostas. As instâncias foram solucionadas otimamente por meio do pacote computacional GAMS/Cplex. A solução exata se mostrou viável apenas em instâncias de pequena dimensão devido à complexidade do problema em estudo. Os resultados computacionais obtidos pelo GAMS/Cplex são apresentados e analisados.<br>The present paper establishes, describes mathematically and solves a multi-level lot sizing and scheduling problem in an industrial set with parallel machines and sequence-dependent setup cost and time. The problem is motivated by real situations found in some industrial settings mainly the soft drink industry. In this kind of industry, the production involves two interdependent levels with decisions about raw material storage and soft drink bottling. The several raw materials are stored in tanks from which they flow to the bottling lines. The challenge is to determine simultaneously the minimum cost lot sizing and scheduling of raw material in tanks and also in the bottling lines, where setup costs and time depend on the previous items stored and bottled. A mixed-integer mathematical model with several combined constrains that use to be handled apart in the literature is proposed. The lack of similar models led us to create a set of instances to evaluate the model and the solution techniques developed. The instances were optimally solved by the GAMS/Cplex software. Due to the problem complexity, it is demonstrated that the use of this optimization package is only viable for small-sized instances. The computational results are showed and analyzed