IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v52y2022i2p158-172.html
   My bibliography  Save this article

A Decision Support System for Brewery Production Planning at Feldschlösschen

Author

Listed:
  • Markus Mickein

    (Institut für Verkehr, Logistik und Produktion, Universität Hamburg, Hamburg D-20148, Germany)

  • Matthes Koch

    (Institut für Verkehr, Logistik und Produktion, Universität Hamburg, Hamburg D-20148, Germany)

  • Knut Haase

    (Institut für Verkehr, Logistik und Produktion, Universität Hamburg, Hamburg D-20148, Germany)

Abstract

We present a decision support system (DSS) for multilevel production planning implemented at the Swiss brewery Feldschlösschen. The software applied mathematical optimization to support supply chain executives in tactical and strategic decision making. We propose a multilevel capacitated lot-sizing problem that covers brewery-specific requirements. The DSS consists of a user interface and visualization tool embedded in a cloud-based optimization framework. The user interface provides data collection with integrated validation. Cloud-based optimization enables the use of virtual machines for effort-intensive computations. Finally, the visualization tool publishes the optimization results as a standardized report. The considered brewing system contains 13 production and 8 storage resources. It produces more than 220 finished and 100 semifinished products. The planning horizon is up to 52 weeks. We present a sample of management analyses concerning assortment strategies, investment decisions, and capacity deployment. The DSS reduces the planning effort while improving planning quality by considering the entire production system and evaluating different production scenarios. Furthermore, it reduces the total cost due to optimized production schedules and avoided ineffective investments.

Suggested Citation

  • Markus Mickein & Matthes Koch & Knut Haase, 2022. "A Decision Support System for Brewery Production Planning at Feldschlösschen," Interfaces, INFORMS, vol. 52(2), pages 158-172, March.
    • Handle: RePEc:inm:orinte:v:52:y:2022:i:2:p:158-172
    DOI: 10.1287/inte.2021.1101
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2021.1101
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2021.1101?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Stadtler, Hartmut & Sahling, Florian, 2013. "A lot-sizing and scheduling model for multi-stage flow lines with zero lead times," European Journal of Operational Research, Elsevier, vol. 225(3), pages 404-419.
    2. Peter J. Billington & John O. McClain & L. Joseph Thomas, 1983. "Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction," Management Science, INFORMS, vol. 29(10), pages 1126-1141, October.
    3. Tamara A. Baldo & Reinaldo Morabito & Maristela O. Santos & Luis Guimarães, 2017. "Alternative Mathematical Models and Solution Approaches for Lot-Sizing and Scheduling Problems in the Brewery Industry: Analyzing Two Different Situations," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-18, August.
    4. Ferreira, Deisemara & Morabito, Reinaldo & Rangel, Socorro, 2009. "Solution approaches for the soft drink integrated production lot sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 196(2), pages 697-706, July.
    5. Hartmut Stadtler, 2003. "Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows," Operations Research, INFORMS, vol. 51(3), pages 487-502, June.
    6. Ferreira, Deisemara & Clark, Alistair R. & Almada-Lobo, Bernardo & Morabito, Reinaldo, 2012. "Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production," International Journal of Production Economics, Elsevier, vol. 136(2), pages 255-265.
    7. Dirk Briskorn & Philipp Zeise, 2019. "A cyclic production scheme for the synchronized and integrated two-level lot-sizing and scheduling problem with no-wait restrictions and stochastic demand," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 895-942, December.
    8. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    9. Stadtler, Hartmut, 2003. "Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 20204, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Haoxun, 2015. "Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems," Omega, Elsevier, vol. 56(C), pages 25-36.
    2. Stadtler, Hartmut, 2011. "Multi-level single machine lot-sizing and scheduling with zero lead times," European Journal of Operational Research, Elsevier, vol. 209(3), pages 241-252, March.
    3. Marcos Mansano Furlan & Maristela Oliveira Santos, 2017. "BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 929-944, April.
    4. Ahmed Senoussi & Youcef Boutarfa & Nadjib Brahimi & Tarik Aouam, 2024. "Sustainable Hybrid Manufacturing and Refurbishing Systems with Substitution," Sustainability, MDPI, vol. 16(17), pages 1-33, August.
    5. Gislaine Mara Melega & Silvio Alexandre de Araujo & Reinaldo Morabito, 2020. "Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems," Annals of Operations Research, Springer, vol. 295(2), pages 695-736, December.
    6. Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.
    7. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2024. "Managing flexibility in stochastic multi-level lot sizing problem with service level constraints," Omega, Elsevier, vol. 122(C).
    8. Tao Wu & Leyuan Shi & Joseph Geunes & Kerem Akartunalı, 2012. "On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times," Journal of Global Optimization, Springer, vol. 53(4), pages 615-639, August.
    9. G. Rius-Sorolla & J. Maheut & S. Estellés-Miguel & J. P. García-Sabater, 2021. "Operations planning test bed under rolling horizons, multiproduct, multiechelon, multiprocess for capacitated production planning modelling with strokes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1289-1315, December.
    10. Hartmut Stadtler & Malte Meistering, 2019. "Model formulations for the capacitated lot-sizing problem with service-level constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 1025-1056, December.
    11. Mac Cawley, Alejandro & Maturana, Sergio & Pascual, Rodrigo & Tortorella, Guilherme Luz, 2022. "Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: Robust formulation and a decomposition solution approach," European Journal of Operational Research, Elsevier, vol. 303(2), pages 819-839.
    12. Wu, Tao & Shi, Leyuan & Geunes, Joseph & AkartunalI, Kerem, 2011. "An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging," European Journal of Operational Research, Elsevier, vol. 214(2), pages 428-441, October.
    13. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
    14. Tao Wu & Leyuan Shi & Jie Song, 2012. "An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times," Annals of Operations Research, Springer, vol. 196(1), pages 635-650, July.
    15. Dziuba, Daryna & Almeder, Christian, 2023. "New construction heuristic for capacitated lot sizing problems," European Journal of Operational Research, Elsevier, vol. 311(3), pages 906-920.
    16. Sahling, Florian & Buschkühl, Lisbeth & Tempelmeier, Horst & Helber, Stefan, 2008. "Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic," Hannover Economic Papers (HEP) dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    17. Lang, Jan Christian & Shen, Zuo-Jun Max, 2011. "Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions," European Journal of Operational Research, Elsevier, vol. 214(3), pages 595-605, November.
    18. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    19. Kristin Uggen & Marte Fodstad & Vibeke Nørstebø, 2013. "Using and extending fix-and-relax to solve maritime inventory routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 355-377, July.
    20. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:52:y:2022:i:2:p:158-172. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.