IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i21p6573-6596.html
   My bibliography  Save this article

Clustering-based solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups

Author

Listed:
  • François Larroche
  • Odile Bellenguez
  • Guillaume Massonnet

Abstract

This paper studies an industrial lot-sizing and scheduling problem coming from the food-industry that extends the multi-item capacitated lot-sizing and includes lost sales, overtimes, safety stock and non-uniform sequence-dependent setups on parallel machines. We introduce two different formulations and adapt the well-known Relax-and-Fix and Fix-and-Optimise heuristics in order to quickly obtain feasible solutions on large industrial instances. The complexity of our problem prevents the procedure to obtain good solutions within the time allocated by practitioners on real-life cases, hence we propose to use a clustering approach to approximate the sequence-dependent setup times. The resulting problem is significantly smaller to solve and experimental results suggest that this transformation effectively improves the solutions found on industrial instances. In particular, the combination of this clustering method and Relax-and-Fix and Fix-and-Optimise procedure turns out to be a promising approach to obtain good solutions in the given time-limit.

Suggested Citation

  • François Larroche & Odile Bellenguez & Guillaume Massonnet, 2022. "Clustering-based solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups," International Journal of Production Research, Taylor & Francis Journals, vol. 60(21), pages 6573-6596, November.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:21:p:6573-6596
    DOI: 10.1080/00207543.2021.1995792
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1995792
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.1995792?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:60:y:2022:i:21:p:6573-6596. 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.

    We have no bibliographic references for this item. You can help adding them by using 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.