IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v194y2025ics1366554524004964.html
   My bibliography  Save this article

A production and distribution scheduling matheuristic for reducing supply chain variations

Author

Listed:
  • Vié, Marie-Sklaerder
  • Zufferey, Nicolas
  • Coelho, Leandro C.

Abstract

In a supply chain network, satisfying the demand at the shop level while having a smooth production at the manufacturer (or plant) level are usually conflicting objectives. For instance, the production variations will be high if the shops can order exactly what they need and when they need it. On the other hand, producing the same amount each day prevents to adapt to the variations of the demand and may generate shortages or excess inventory. This study, performed in collaboration with a major fast-moving consumer goods company, proposes a lexicographic model for managing the supply chain in an integrated manner. Seven objective functions are considered to represent the goals of various stakeholders along the supply chain (from the shop to the plant) and different priority levels. A matheuristic combining both local-search procedures and exact methods is designed for scheduling the production orders and the shipments along the supply chain to optimize the overall cost structure. The proposed neighborhood structures employed in the local-search heuristics are able to perform dedicated modifications with respect to a single objective function (e.g., shortage, production variability, inventory level) and a single solution characteristic (e.g., production, shipment) without degrading the value of higher-level objectives. As computation time is limited, a time management approach for this method is proposed. Experiments are performed on 120 instances generated with the company to capture the real situations it faces. Using a rolling-window simulation with forecasted demands, we show that our method clearly outperforms a commercial solver and several common policies used in practice. The benefit of the proposed approach is highlighted both in terms of runtime and solution quality.

Suggested Citation

  • Vié, Marie-Sklaerder & Zufferey, Nicolas & Coelho, Leandro C., 2025. "A production and distribution scheduling matheuristic for reducing supply chain variations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
  • Handle: RePEc:eee:transe:v:194:y:2025:i:c:s1366554524004964
    DOI: 10.1016/j.tre.2024.103905
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524004964
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2024.103905?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.

    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:transe:v:194:y:2025:i:c:s1366554524004964. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.