IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v4y2023i2d10.1007_s43069-023-00230-7.html
   My bibliography  Save this article

Relax-and-Fix Heuristics Applied to a Real-World Lot Sizing and Scheduling Problem in the Personal Care Consumer Goods Industry

Author

Listed:
  • K. A. G. Araujo

    (University of São Paulo)

  • E. G. Birgin

    (University of São Paulo)

  • M. S. Kawamura

    (University of São Paulo)

  • D. P. Ronconi

    (University of São Paulo)

Abstract

This paper addresses an integrated lot sizing and scheduling problem in the industry of consumer goods for personal care, a very competitive market in which good customer service and cost management are crucial in the competition for clients. In this research, a complex operational environment composed of unrelated parallel machines with limited production capacity and sequence-dependent setup times and costs is studied. There is also a limitation in the total storage capacity for finished goods, a characteristic not found in the literature. Backordering is allowed, but it is extremely undesirable. The problem is described through a mixed integer linear programming formulation. Since the problem is NP-hard, relax-and-fix heuristics with hybrid partitioning strategies are investigated. Computational experiments with randomly generated and real-world instances are presented. The results show the efficacy and efficiency of the proposed approaches. Compared to the current solutions used by the company, the best proposed strategies yield results with substantially lower costs, primarily from the reduction in inventory levels and better allocation of production batches on the machines.

Suggested Citation

  • K. A. G. Araujo & E. G. Birgin & M. S. Kawamura & D. P. Ronconi, 2023. "Relax-and-Fix Heuristics Applied to a Real-World Lot Sizing and Scheduling Problem in the Personal Care Consumer Goods Industry," SN Operations Research Forum, Springer, vol. 4(2), pages 1-30, June.
    • Handle: RePEc:spr:snopef:v:4:y:2023:i:2:d:10.1007_s43069-023-00230-7
    DOI: 10.1007/s43069-023-00230-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-023-00230-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-023-00230-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ríos-Solís, Yasmín Á & Ibarra-Rojas, Omar J. & Cabo, Marta & Possani, Edgar, 2020. "A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production," European Journal of Operational Research, Elsevier, vol. 284(3), pages 861-873.
    2. Meyr, H., 2000. "Simultaneous Lotsizing and Scheduling by combining Local Search with Dual Reoptimization," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 39380, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    3. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
    4. Fleischmann, B. & Meyr, H., 1997. "The General Lotsizing and Scheduling Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36068, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    5. Meyr, Herbert & Mann, Matthias, 2013. "A decomposition approach for the General Lotsizing and Scheduling Problem for Parallel production Lines," European Journal of Operational Research, Elsevier, vol. 229(3), pages 718-731.
    6. 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.
    7. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, June.
    8. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    9. Martin Wörbelauer & Herbert Meyr & Bernardo Almada-Lobo, 2019. "Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 1-43, March.
    10. Jesica de Armas & Manuel Laguna, 2020. "Parallel machine, capacitated lot-sizing and scheduling for the pipe-insulation industry," International Journal of Production Research, Taylor & Francis Journals, vol. 58(3), pages 800-817, February.
    11. Sungmin Kang & Kavindra Malik & L. Joseph Thomas, 1999. "Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs," Management Science, INFORMS, vol. 45(2), pages 273-289, February.
    12. Meyr, H., 2002. "Simultaneous Lotsizing and Scheduling on Parallel Machines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36065, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    13. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    14. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    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. 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.
    2. 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.
    3. Daniel Quadt & Heinrich Kuhn, 2009. "Capacitated lot‐sizing and scheduling with parallel machines, back‐orders, and setup carry‐over," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(4), pages 366-384, June.
    4. Meyr, Herbert & Mann, Matthias, 2013. "A decomposition approach for the General Lotsizing and Scheduling Problem for Parallel production Lines," European Journal of Operational Research, Elsevier, vol. 229(3), pages 718-731.
    5. Guimarães, Luis & Klabjan, Diego & Almada-Lobo, Bernardo, 2013. "Pricing, relaxing and fixing under lot sizing and scheduling," European Journal of Operational Research, Elsevier, vol. 230(2), pages 399-411.
    6. Fabrizio Marinelli & Maria Nenni & Antonio Sforza, 2007. "Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company," Annals of Operations Research, Springer, vol. 150(1), pages 177-192, March.
    7. Lee, Younsoo & Lee, Kyungsik, 2022. "New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 302(1), pages 230-243.
    8. Guimarães, Luis & Klabjan, Diego & Almada-Lobo, Bernardo, 2014. "Modeling lotsizing and scheduling problems with sequence dependent setups," European Journal of Operational Research, Elsevier, vol. 239(3), pages 644-662.
    9. 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.
    10. Kovcs, Andrs & Brown, Kenneth N. & Tarim, S. Armagan, 2009. "An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups," International Journal of Production Economics, Elsevier, vol. 118(1), pages 282-291, March.
    11. Carvalho, Desiree M. & Nascimento, Mariá C.V., 2022. "Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup," European Journal of Operational Research, Elsevier, vol. 296(1), pages 158-173.
    12. Józefowska, J. & Zimniak, A., 2008. "Optimization tool for short-term production planning and scheduling," International Journal of Production Economics, Elsevier, vol. 112(1), pages 109-120, March.
    13. Masoumeh Mahdieh & Alistair Clark & Mehdi Bijari, 2018. "A novel flexible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in different machine configurations," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 884-923, December.
    14. Ríos-Solís, Yasmín Á & Ibarra-Rojas, Omar J. & Cabo, Marta & Possani, Edgar, 2020. "A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production," European Journal of Operational Research, Elsevier, vol. 284(3), pages 861-873.
    15. Martin Wörbelauer & Herbert Meyr & Bernardo Almada-Lobo, 2019. "Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 1-43, March.
    16. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, June.
    17. Alyne Toscano & Deisemara Ferreira & Reinaldo Morabito, 2019. "A decomposition heuristic to solve the two-stage lot sizing and scheduling problem with temporal cleaning," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 142-173, March.
    18. 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.
    19. Lee, Younsoo & Lee, Kyungsik, 2020. "Lot-sizing and scheduling in flat-panel display manufacturing process," Omega, Elsevier, vol. 93(C).
    20. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.

    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:spr:snopef:v:4:y:2023:i:2:d:10.1007_s43069-023-00230-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.