IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i11p2185-2199.html
   My bibliography  Save this article

Collaborative optimization of route planning and just-in-time scheduling for mixed-model assembly lines

Author

Listed:
  • Yunfang Peng
  • Chenting Wu
  • Wenqing Shao
  • Beixin Xia

Abstract

With increasingly diversified consumer demands, mixed-model assembly lines have been increasingly adopted by manufacturing enterprises. In recent years, more and more manufacturers adopted material supermarkets to enable a flexible and reliable Just-in-Time part supply of their mixed-model assembly lines. However, it is still a crucial challenge to ensure the implementation of Just-in-time part supply, and few research studies on the problem. Therefore, this article proposes the problem of collaborative optimizing route planning and material distribution scheduling with just-in-time principle. A mixed integer linear programming model is established with the objective of minimizing the total costs. Moreover, a dynamic programming based heuristic algorithm is developed to deal with large-sized problems. Computational experiments on different scales are carried out to test this algorithm. The computational results reveal the feasibility and effectiveness of the proposed algorithm. And considering different capacity of tow trains, results show the change of capacity affects the total cost by affecting the number of paths divided, which provides guidance for manufacturing enterprises.

Suggested Citation

  • Yunfang Peng & Chenting Wu & Wenqing Shao & Beixin Xia, 2024. "Collaborative optimization of route planning and just-in-time scheduling for mixed-model assembly lines," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(11), pages 2185-2199, November.
  • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:11:p:2185-2199
    DOI: 10.1080/01605682.2024.2310042
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2024.2310042
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2024.2310042?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:tjorxx:v:75:y:2024:i:11:p:2185-2199. 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/tjor .

    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.