IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04209847.html
   My bibliography  Save this paper

A real life batch-sizing and sequencing problem with capacitated buffer and setup times

Author

Listed:
  • Nicola La Palombara
  • Walid Behiri

    (COSYS-GRETTIA - Génie des Réseaux de Transport Terrestres et Informatique Avancée - Université Gustave Eiffel)

  • Sana Belmokhtar Berraf

    (COSYS-GRETTIA - Génie des Réseaux de Transport Terrestres et Informatique Avancée - Université Gustave Eiffel)

  • Chenbin Chu
  • Mustapha Sali

    (DRM - Dauphine Recherches en Management - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique)

Abstract

This study deals with a real-life batch sizing and sequencing problem where sequence-dependent setup times are necessary when changing the production from one type of product to another. Given an internal demand to be fulfilled at each period t from buffers, one has to organize the production to replenish the buffers so as to keep the inventory levels between predefined bounds at any time, while respecting a minimum batch size. To simultaneously define which type of product and for how long time to produce, we propose an Integer Linear Programming (ILP) formulation which determines the optimal sequence of machine states over the planning horizon. We distinguish three possible states: production, setup or changeovers and idle states. The first experiments are carried out on small-size instances, using Cplex solver. As future work, we will extend the model to better represent the real case and then we aim to develope approximate resolution methods to solve larger instances based on real data.

Suggested Citation

  • Nicola La Palombara & Walid Behiri & Sana Belmokhtar Berraf & Chenbin Chu & Mustapha Sali, 2023. "A real life batch-sizing and sequencing problem with capacitated buffer and setup times," Post-Print hal-04209847, HAL.
    • Handle: RePEc:hal:journl:hal-04209847
    Note: View the original document on HAL open archive server: https://hal.science/hal-04209847
    as

    Download full text from publisher

    File URL: https://hal.science/hal-04209847/document
    Download Restriction: no
    ---><---

    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:hal:journl:hal-04209847. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.