Mathematical programming-based approaches for multi-facility Glass container production planning. (English) Zbl 1349.90283
Summary: This paper introduces a mathematical model (together with a relaxed version) and solution approaches for the multi-facility glass container production planning (MF-GCPP) problem. The glass container industry covers the production of glass packaging (bottle and jars), where a glass paste is continuously distributed to a set of parallel molding machines that shape the finished products. Each facility has a set of furnaces where the glass paste is produced in order to meet the demand. Furthermore, final product transfers between facilities are allowed to face demand. The objectives include meeting demand, minimizing inventory investment and transportation costs, as well as maximizing the utilization of the production facilities. A novel mixed integer programming formulation is introduced for MF-GCPP and solution approaches applying heuristics and meta-heuristics based on mathematical programming are developed. A multi-population genetic algorithm defines for each individual the partitions of the search space to be optimized by the MIP solver. A variant of the fix-and-optimize improvement heuristic is also introduced. The computational tests are carried on instances generated from real-world data provided by a glass container company. The results show that the proposed methods return competitive results for smaller instances, comparing to an exact solver method. In larger instances, the proposed methods are able to return high quality solutions.
MSC:
| 90B30 | Production models |
| 90B05 | Inventory, storage, reservoirs |
| 90C11 | Mixed integer programming |
| 90C59 | Approximation methods and heuristics in mathematical programming |
Keywords:
Glass container industry; multi-facility; lotsizing and scheduling; MP based heuristics; genetic algorithmsReferences:
| [1] | Almada-Lobo, B.; Oliveira, J.; Carravilla, M., Production planning and scheduling in the glass container industrya VNS approach, Int J Prod Econ, 114, 1, 363-375 (2008) |
| [2] | Dhaenens-Flipo, C.; Finke, G., An integrated model for an industrial production-distribution problem, IIE Trans (Inst Ind Eng), 33, 9, 705-715 (2001) |
| [3] | Guimaraes, L.; Klabjan, D.; Almada-Lobo, B., Annual production budget in the beverage industry, Eng Appl Artif Intell, 25, 2, 229-241 (2012) |
| [4] | Chandra, P.; Fisher, M., Coordination of production and distribution planning, Eur J Oper Res, 72, 3, 503-517 (1994) · Zbl 0805.90051 |
| [6] | Karimi, B.; Ghomi, S. M.T. F.; Wilson, J. M., The capacitated lot sizing problema review of models and algorithms, Omega, 31, 365-378 (2003) |
| [7] | Robinson, P.; Narayanan, A.; Sahin, F., Coordinated deterministic dynamic demand lot-sizing problema review of models and algorithms, Omega, 37, 1, 3-15 (2009) |
| [8] | Jans, R., Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints, INFORMS J Comput, 21, 1, 123-136 (2009) · Zbl 1243.90147 |
| [9] | Jans, R.; Degraeve, Z., Metaheuristics for dynamic lot sizinga review and comparison of solution approaches, Eur J Oper Res, 177, 1855-1875 (2007) · Zbl 1102.90002 |
| [10] | Almada-Lobo, B.; Klabjan, D.; Carravilla, M. A.; Oliveira, J. F., Multiple machine continuous setup lotsizing with sequence-dependent setups, Comput Opt Appl, 47, 3, 529-552 (2010) · Zbl 1206.90030 |
| [11] | Toledo, C.; Arantes, M.; Oliveira, R.; Almada-Lobo, B., Glass container production scheduling through hybrid multi-population based evolutionary algorithm, Appl Soft Comput, 13, 3, 1352-1364 (2013) |
| [12] | Ball, M., Heuristics based on mathematical programming, Surv Oper Res Manag Sci, 16, 1, 21-38 (2011) |
| [13] | James, R.; Almada-Lobo, B., Single and parallel machine capacitated lotsizing and schedulingnew iterative MIP-based neighborhood search heuristics, Comput Oper Res, 38, 12, 1816-1825 (2011) · Zbl 1215.90027 |
| [14] | Beraldi, P.; Ghiani, G.; Grieco, A.; Guerriero, E., Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs, Comput Oper Res, 35, 11, 3644-3656 (2008) · Zbl 1170.90386 |
| [15] | Sahling, F.; Buschkühl, L.; Tempelmeier, H.; Helber, S., Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic, Comput Oper Res, 37, 2546-2553 (2009) · Zbl 1179.90018 |
| [16] | Camargo, V.; Toledo, F.; Almada-Lobo, B., HOPShamming-oriented partition search for production planning in the spinning industry, Eur J Oper Res, 234, 1, 266-277 (2014) · Zbl 1305.90020 |
| [17] | Araujo, S.; Arenales, M.; Clark, A., Lot sizing and furnace scheduling in small foundries, Comput Oper Res, 35, 3, 916-932 (2008) · Zbl 1278.90180 |
| [18] | Toso, E.; Morabito, R.; Clark, A., Lot sizing and sequencing optimisation at an animal-feed plant, Comput Ind Eng, 57, 3, 813-821 (2009) |
| [19] | Clark, A.; Morabito, R.; Toso, E., Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching, J Sched, 13, 2, 111-121 (2010) · Zbl 1184.90058 |
| [20] | Ferreira, D.; Morabito, R.; Rangel, S., Solution approaches for the soft drink integrated production lot sizing and scheduling problem, Eur J Oper Res, 196, 2, 697-706 (2009) · Zbl 1163.90832 |
| [21] | Ferreira, D.; Clark, A.; Almada-Lobo, B.; Morabito, R., Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production, Int J Prod Econ, 136, 2, 255-265 (2012) |
| [22] | Helber, S.; Sahling, F., A fix-and-optimize approach for the multi-level capacitated lot sizing problem, Int J Prod Econ, 123, 247-256 (2010) |
| [23] | Boussaid, I.; Lepagnot, J.; Siarry, P., A survey on optimization metaheuristics, Inf Sci, 237, 0, 82-117 (2013) · Zbl 1321.90156 |
| [24] | Goren, H.; Tunali, S.; Jans, R., A review of applications of genetic algorithms in lot sizing, J Intell Manuf, 21, 4, 575-590 (2010) |
| [25] | Gen, M.; Lin, L.; Zhang, H., Evolutionary techniques for optimization problems in integrated manufacturing systemstate-of-the-art-survey, Comput Ind Eng, 56, 3, 779-808 (2009) |
| [28] | Toledo, C.; Franca, P.; Morabito, R.; Kimms, A., Multi-population genetic algorithm to solve the synchronized and integrated two-level lot-sizing and scheduling problem, Int J Prod Res, 47, 11, 3097-3119 (2009) · Zbl 1198.90211 |
| [29] | Almeder, C., A hybrid optimization approach for multi-level capacitated lot-sizing problems, Eur J Oper Res, 200, 599-606 (2010) · Zbl 1177.90121 |
| [30] | Seeanner, F.; Almada-Lobo, B.; Meyr, H., Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems, Comput Oper Res, 40, 1, 303-317 (2013) · Zbl 1349.90046 |
| [32] | Toledo, C.; Oliveira, R.; Franca, P., A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging, Comput Oper Res, 40, 4, 910-919 (2013) · Zbl 1349.90862 |
| [33] | Bäck, T., Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms (1996), Oxford University Press: Oxford University Press Oxford, UK, ISBN 0-19-509971-0 · Zbl 0877.68060 |
| [35] | Corder, G. W.; Foreman, D. I., Nonparametric statistics: a step-by-step approach (2014), John Wiley& Sons, Inc.: John Wiley& Sons, Inc. Hoboken, New Jersey · Zbl 1288.62001 |
| [36] | Dunn, O. J., Multiple comparisons using rank sums, Technometrics, 6, 3, 241-252 (1964) |
| [37] | Demšar, J., Statistical comparisons of classifiers over multiple data sets, J Mach Learn Res, 7, 1-30 (2006), ISSN 1532-4435, 〈http://dl.acm.org/citation.cfm?id=1248547.1248548〉 · Zbl 1222.68184 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
