IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v296y2022i1p158-173.html
   My bibliography  Save this article

Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup

Author

Listed:
  • Carvalho, Desiree M.
  • Nascimento, Mariá C.V.

Abstract

This paper approaches the integrated lot sizing and scheduling problem (ILSSP), in which non-identical machines work in parallel with non-triangular sequence-dependent setup costs and times, setup carry-over and capacity limitation. The aim of the studied ILSSP, here called ILSSP-NT on parallel machines, is to determine a production planning and tasks sequencing that meet period demands without delay and in such a way that the total costs of production, machine setup and inventory are minimized. The dearth of literature on the ILSSP-NT, despite the increasing amount of applications in the industrial sector, mainly in the food processing industry, motivated us to conduct this study. In this paper, we propose efficient methods to solve the ILSSP-NT on parallel machines. The methods virtually consist in the hybridization of the relax-and-fix and fix-and-optimize methods with the path-relinking and kernel search heuristics. To assess how well the heuristics solve the ILSSP-NT on parallel machines, we compared their results with those of the CPLEX solver with a fixed CPU time limit. The proposed matheuristics significantly outperformed CPLEX in most of the tested instances.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:296:y:2022:i:1:p:158-173
    DOI: 10.1016/j.ejor.2021.03.050
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721002769
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.03.050?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. Boonmee, Atiwat & Sethanan, Kanchana, 2016. "A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry," European Journal of Operational Research, Elsevier, vol. 250(2), pages 652-665.
    2. 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.
    3. 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.
    4. Dimitri P. Bertsekas & Paul Tseng, 1988. "Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems," Operations Research, INFORMS, vol. 36(1), pages 93-114, February.
    5. Guastaroba, G. & Savelsbergh, M. & Speranza, M.G., 2017. "Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs," European Journal of Operational Research, Elsevier, vol. 263(3), pages 789-804.
    6. 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.
    7. 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.
    8. Maes, Johan & McClain, John O. & Van Wassenhove, Luk N., 1991. "Multilevel capacitated lotsizing complexity and LP-based heuristics," European Journal of Operational Research, Elsevier, vol. 53(2), pages 131-148, July.
    9. 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.
    10. 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.
    11. 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).
    12. Nascimento, Mariá C.V. & Resende, Mauricio G.C. & Toledo, Franklina M.B., 2010. "GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem," European Journal of Operational Research, Elsevier, vol. 200(3), pages 747-754, February.
    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.
    15. 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.
    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. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bunn, Kevin A. & Ventura, José A., 2023. "A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs," European Journal of Operational Research, Elsevier, vol. 307(1), pages 116-129.
    2. Lee, Younsoo & Lee, Kyungsik, 2023. "Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 310(1), pages 201-216.
    3. 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.
    4. Miloš Milenković & Susana Val & Nebojša Bojović, 2023. "Simultaneous lot sizing and scheduling in the animal feed premix industry," Operational Research, Springer, vol. 23(2), pages 1-40, June.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Hu, Zhengyang & Hu, Guiping, 2016. "A two-stage stochastic programming model for lot-sizing and scheduling under uncertainty," International Journal of Production Economics, Elsevier, vol. 180(C), pages 198-207.
    13. Camargo, Victor C.B. & Toledo, Franklina M.B. & Almada-Lobo, Bernardo, 2014. "HOPS – Hamming-Oriented Partition Search for production planning in the spinning industry," European Journal of Operational Research, Elsevier, vol. 234(1), pages 266-277.
    14. 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.
    15. 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.
    16. Diego Fiorotto & Silvio Araujo, 2014. "Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines," Annals of Operations Research, Springer, vol. 217(1), pages 213-231, June.
    17. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    18. 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.
    19. Curcio, Eduardo & Amorim, Pedro & Zhang, Qi & Almada-Lobo, Bernardo, 2018. "Adaptation and approximate strategies for solving the lot-sizing and scheduling problem under multistage demand uncertainty," International Journal of Production Economics, Elsevier, vol. 202(C), pages 81-96.
    20. Boysen, Nils & Emde, Simon, 2014. "Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets," European Journal of Operational Research, Elsevier, vol. 239(3), pages 820-829.

    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:eee:ejores:v:296:y:2022:i:1:p:158-173. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.