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

The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery

Author

Listed:
  • Shengluo Yang
  • Zhigang Xu

Abstract

The scheduling problems of distributed production have received increasing attention in recent years. To coordinate the scheduling of production and transportation, we propose a novel distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery (DAPFSP-FABD). The objective is to minimise the total cost of delivery and tardiness. Given that the problem involves six successive decisions, several batch allocation strategies for both production and distribution are proposed, and four neighbourhood structures are designed to search for the best batch sequence, batch allocation, product sequence, and job sequence. Seven algorithms, including four heuristics, a variable neighbourhood descent (VND) algorithm, and two iterated greedy (IG) algorithms, are proposed. In the IG, two types of destruction and construction operations are present to facilitate escape from local optima, thereby resulting in two IG algorithms: IG_desP and IG_desJ. Finally, extensive computational and statistical experiments are carried out. The results show that the proposed batch allocation strategies can improve the solution significantly. Additionally, the heuristics can obtain reasonable solutions in a short time, while IG_desJ performs the best regarding the quality of solutions. This study can help cross-regional companies coordinate the scheduling of production and transportation and enhance the performance of supply chains.

Suggested Citation

  • Shengluo Yang & Zhigang Xu, 2021. "The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery," International Journal of Production Research, Taylor & Francis Journals, vol. 59(13), pages 4053-4071, July.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:13:p:4053-4071
    DOI: 10.1080/00207543.2020.1757174
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mohammad Rostami & Milad Mohammadi, 2024. "Two-machine decentralized flow shop scheduling problem with inter-factory batch delivery system," Operational Research, Springer, vol. 24(3), pages 1-37, September.
    2. He, Xuan & Pan, Quan-Ke & Gao, Liang & Neufeld, Janis S. & Gupta, Jatinder N.D., 2024. "Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times," Omega, Elsevier, vol. 123(C).

    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:59:y:2021:i:13:p:4053-4071. 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.