IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v332y2026i1p322-335.html

Minimizing total travel time in the flexible job-shop scheduling problem with transportation resources

Author

Listed:
  • Berterottière, Lucas
  • Dauzère-Pérès, Stéphane
  • Yugma, Claude
  • Huang, Kwei-Long

Abstract

Time-dependent manufacturing criteria, such as makespan or mean flow time, are commonly optimized in scheduling problems. Prioritizing these criteria is motivated by their correlation with key performance indicators, such as throughput and cycle time in flexible manufacturing systems. However, when transportation resources must also be explicitly managed, only optimizing manufacturing criteria may result in very poor schedules in terms of the distance traveled by the vehicles. This research aims to simultaneously optimize the makespan and the distance traveled by the vehicles, called total travel time, in the flexible job-shop scheduling problem with transportation resources. New generic neighborhood structures are proposed as well as an exact constant-time evaluation of the neighbor solutions in terms of total travel time. These findings are then used to introduce several optimization approaches in order to determine schedules that optimize both the makespan and the total travel time. The proposed approaches are experimentally tested on benchmark instances, and the numerical results are discussed, in particular the impact of the factory layout and the number of vehicles.

Suggested Citation

  • Berterottière, Lucas & Dauzère-Pérès, Stéphane & Yugma, Claude & Huang, Kwei-Long, 2026. "Minimizing total travel time in the flexible job-shop scheduling problem with transportation resources," European Journal of Operational Research, Elsevier, vol. 332(1), pages 322-335.
    • Handle: RePEc:eee:ejores:v:332:y:2026:i:1:p:322-335
    DOI: 10.1016/j.ejor.2025.11.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725009312
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.11.020?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:ejores:v:332:y:2026:i:1:p:322-335. 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/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.