Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company

Marinelli, Fabrizio; Nenni, Maria Elena; Sforza, Antonio

doi:10.1007/s10479-006-0157-x

Cited by 77 publications

(33 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The objective in the mathematical models is to minimize the inventory and backlog costs, as well as the number of setup changeovers in the filling lines (each change implies a small penalty in the objective function). The third term in the objective function is of a second order in comparison with the first two terms (observe that the value of alpha is a sufficiently small number; see function (1)). This small penalty aims at ensuring that, among the minimum cost solutions (first two terms), the optimal solution results in a small number of setup changeovers in periods with idle capacity.…”

Section: (I) Liquid Preparation (Stage I)mentioning

confidence: 99%

“…Integrated lot-sizing and scheduling (sequencing) are a widely studied area [1,2]. The recent literature reviews by Almada-Lobo et al [3] and Copil et al [4] highlight an increasing interest in simultaneous lot-sizing and scheduling problems in many companies, resulting in researches motivated by industrial practical applications, such as glass container [5], animal nutrition [6], soft drink [7], wood floor [8], pulp and paper mill [9], food [10], automotive applications [11], supermarkets [12], and thin film transistor and liquid crystal display [13].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Alternative Mathematical Models and Solution Approaches for Lot‐Sizing and Scheduling Problems in the Brewery Industry: Analyzing Two Different Situations

Baldo

Morábito

Santos

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This research proposes new approaches to deal with the production planning and scheduling problem in brewery facilities. Two real situations found in factories are addressed, which differ by considering (or not) the setup operations in tanks that provide liquid for bottling lines. Depending on the technology involved in the production process, the number of tank swaps is relevant (Case A) or it can be neglected (Case B). For both scenarios, new MIP (Mixed Integer Programming) formulations and heuristic solution methods based on these formulations are proposed. In order to evaluate the approach for Case A, we compare the results of a previous study with the results obtained in this paper. For the solution methods and the result analysis of Case B, we propose adaptations of Case A approaches yielding an alternative MIP formulation to represent it. Therefore, the main contributions of this article are twofold: (i) to propose alternative MIP models and solution methods for the problem in Case A, providing better results than previously reported, and (ii) to propose new MIP models and solution methods for Case B, analyzing and comparing the results and benefits for Case B considering the technology investment required.

show abstract

Section: (I) Liquid Preparation (Stage I)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Alternative Mathematical Models and Solution Approaches for Lot‐Sizing and Scheduling Problems in the Brewery Industry: Analyzing Two Different Situations

Baldo

Morábito

Santos

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…The lot-sizing and scheduling problems have been widely used in several productive sectors (e.g., Araujo et al, 2008;Almada-Lobo et al, 2008;Luche et al, 2009;Toso et al, 2009;Santos & AlmadaLobo, 2012;Marinelli et al, 2007;Kopanos et al, 2010, among many others). Some studies are found in the production of non-alcoholic drinks such as soft drinks, water, tea and juice, but most of these studies consider soft drink production lines.…”

Section: Introductionmentioning

confidence: 99%

Otimização da programação da produção de bebidas à base de frutas por meio de modelos de programação inteira mista

2016

View full text Add to dashboard Cite

ResumoNeste estudo, considera-se um problema de dimensionamento e programação de lotes de produção de bebidas não alcoólicas à base de frutas. O problema é caracterizado por horizonte de planejamento com múltiplos períodos, processo de produção com máquinas distintas, restrições de capacidades de produção e tempos de preparação das máquinas independentes da sequência de produção, além de condições especiais de preparações, como limpezas obrigatórias das máquinas dentro de limitações de tempo de produção. Para tratar o problema, propõe-se uma abordagem de solução baseada em modelos de programação matemática e uso de softwares de otimização. Os modelos são modificações de modelos de programação linear inteira mista conhecidos na literatura de dimensionamento e programação de lotes de produção. Porém, ao invés de considerar múltiplas máquinas em paralelo, os modelos propostos exploram outras possíveis configurações de máquinas para representar apropriadamente os processos de produção envolvidos na produção de bebidas à base de frutas. A abordagem proposta é validada por meio de um estudo realizado em uma fábrica de sucos e néctares de frutas no interior do Estado de São Paulo, em que as soluções obtidas pelos modelos foram testadas e analisadas em situações realistas da empresa. Os resultados mostram que a abordagem tem bom potencial de aplicação prática. Palavras-chave: Indústria de bebidas não alcoólicas; Planejamento da produção; Programação inteira mista; Dimensionamento de lotes. AbstractThis study considers a production lot-sizing and scheduling problem of non-alcoholic fruit juice beverages. The problem is characterized by a multi-period planning horizon, a production process with different machines, capacity constraints and setup times independent from the production sequence, as well as special conditions regarding required machines clean-in-place (CIP) within production time periods. To deal with this problem, we propose a solution approach based on mathematical programming and using optimization software. The models are modifications of mixed integer programming models known in the lot sizing and scheduling literature. However, instead of considering multiple parallel machines, the proposed models explore other possible configurations of machines to properly represent the production processes involved in producing fruit beverages. The proposed approach is validated by a study carried out in a fruit juice company located in the interior of Sao Paulo State, Brazil, in which the solutions obtained by the models were tested and analyzed in real situations at the company. The results show that the approach is potentially good for practical applications.

show abstract

“…Since Araujo et al (2007), many other authors have also researched the intergrated lot-sizing and sequencing problem, with material preparation at a prior stage, in a wide range of industrial settings, for example, in soft drink production (Toledo et al, 2009and Ferreira et al, 2009, animal feed (Toso et al, 2009 andClark et al, 2010), electrofused grains (Luche et al, 2009), glass bottles (Almada- Lobo et al, 2007Lobo et al, , 2008, foundries (Araujo et al, 2008;Tonaki andToledo, 2010 andCamargo et al, 2012), yogurt packaging company (Marinelli et al, 2007), pharmaceutical company (Stadtler, 2011), and sand casting operations (Hans and Van de Velde, 2011).…”

Section: Introductionmentioning

confidence: 99%

A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem

Araújo

Clark

2013

Computers & Industrial Engineering

View full text Add to dashboard Cite

In a previous paper (Araujo et al. 2007), the authors proposed a lot sizing and sequencing model for a production process where a key material is prepared and then transformed into different final items. The lot sizing decisions concern not only the production of final items, but also that of the prepared material in order to take account of their sequence-dependent setup costs and times. The number of articles published in recent years shows the relevance of this problem in various industrial settings. In this paper, facility location reformulation and strengthening contraints are newly applied to improve the quality and computing time of the solution. Three alternative metaheuristics are used to fix the setup variables, resulting in much improved performance over previous research, especially regarding the use of the metaheuristics for larger instances.

show abstract

Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company

Cited by 77 publications

References 35 publications

Alternative Mathematical Models and Solution Approaches for Lot‐Sizing and Scheduling Problems in the Brewery Industry: Analyzing Two Different Situations

Alternative Mathematical Models and Solution Approaches for Lot‐Sizing and Scheduling Problems in the Brewery Industry: Analyzing Two Different Situations

Otimização da programação da produção de bebidas à base de frutas por meio de modelos de programação inteira mista

A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem

Contact Info

Product

Resources

About