An optimization approach for the lot sizing and scheduling problem in the brewery industry

被引:50
作者
Baldo, Tamara A. [1 ]
Santos, Maristela O. [1 ]
Almada-Lobo, Bernardo [2 ]
Morabito, Reinaldo [3 ]
机构
[1] Univ Sao Paulo, Inst Ciencias Matemat & Computacao, BR-13560970 Sao Carlos, SP, Brazil
[2] Univ Porto, Fac Engn, INESC TEC, P-4200465 Porto, Portugal
[3] Univ Fed Sao Carlos, Dept Prod Engn, BR-13565905 Sao Carlos, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
Mixed integer programming; Brewery industry; MIP based heuristic; Production planning and scheduling; PARALLEL MACHINES; TIMES; HEURISTICS; MODELS;
D O I
10.1016/j.cie.2014.02.008
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This study considers a production lot sizing and scheduling problem in the brewery industry. The underlying manufacturing process can be basically divided into two main production stages: preparing the liquids including fermentation and maturation inside the fermentation tanks; and bottling the liquids on the filling lines, making products of different liquids and sizes. This problem differs from other problems in beverage industries due to the relatively long lead times required for the fermentation and maturation processes and because the "ready" liquid can remain in the tanks for some time before being bottled. The main planning challenge is to synchronize the two stages (considering the possibility of a "ready" liquid staying in the tank until bottling), as the production bottlenecks may alternate between these stages during the planning horizon. This study presents a novel mixed integer programming model that represents the problem appropriately and integrates both stages. In order to solve real-world problem instances, MIP-based heuristics are developed, which explore the model structure. The results show that the model is able to comprise the problem requirements and the heuristics produce relatively good-quality solutions. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:58 / 71
页数:14
相关论文
共 32 条
[1]   Production planning and scheduling in the glass container industry: A VNS approach [J].
Almada-Lobo, Bernardo ;
Oliveira, Jose F. ;
Carravilla, Maria Antonia .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 114 (01) :363-375
[2]  
[Anonymous], J HEURISTICS
[3]   A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem [J].
Araujo, Silvio Alexandre ;
Clark, Alistair .
COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 65 (04) :577-585
[4]   HEURISTICS FOR MULTILEVEL LOT-SIZING WITH A BOTTLENECK [J].
BILLINGTON, PJ ;
MCCLAIN, JO ;
THOMAS, LJ .
MANAGEMENT SCIENCE, 1986, 32 (08) :989-1006
[5]   COMPUTATIONAL-COMPLEXITY OF THE CAPACITATED LOT SIZE PROBLEM [J].
BITRAN, GR ;
YANASSE, HH .
MANAGEMENT SCIENCE, 1982, 28 (10) :1174-1186
[6]   Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching [J].
Clark, Alistair R. ;
Morabito, Reinaldo ;
Toso, Eli A. V. .
JOURNAL OF SCHEDULING, 2010, 13 (02) :111-121
[7]   Rolling-horizon lot-sizing when set-up times are sequence-dependent [J].
Clark, AR ;
Clark, SJ .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (10) :2287-2307
[8]   COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS [J].
Dale Luche, Jose Roberto ;
Morabito, Reinaldo ;
Pureza, Vitoria .
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2009, 26 (03) :421-443
[9]   A lot-sizing problem in an automated foundry [J].
dos Santos-Meza, E ;
dos Santos, MO ;
Arenales, MN .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (03) :490-500
[10]   Lot sizing and scheduling - Survey and extensions [J].
Drexl, A ;
Kimms, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 99 (02) :221-235