IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i20p3854-d945305.html
   My bibliography  Save this article

Mathematical Formulations for Asynchronous Parallel Disassembly Planning of End-of-Life Products

Author

Listed:
  • Leilei Meng

    (School of Computer Science, Liaocheng University, Liaocheng 252000, China)

  • Biao Zhang

    (School of Computer Science, Liaocheng University, Liaocheng 252000, China)

  • Yaping Ren

    (Department of Industrial Engineering, School of Intelligent Systems Science and Engineering, Jinan University, Zhuhai 519070, China)

  • Hongyan Sang

    (School of Computer Science, Liaocheng University, Liaocheng 252000, China)

  • Kaizhou Gao

    (School of Computer Science, Liaocheng University, Liaocheng 252000, China)

  • Chaoyong Zhang

    (State Key Lab of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430074, China)

Abstract

Disassembly is one of the most time-consuming and labor-intensive activities during the value recovery of end-of-life (EOL) products. The completion time (makespan) of disassembling EOL products is highly associated with the allocation of operators, especially in parallel disassembly. In this paper, asynchronous parallel disassembly planning (APDP), which avoids the necessity to synchronize disassembly tasks of manipulators during the parallel disassembly process, is studied to optimize the task assignment of manipulators for minimal makespan. We utilize four mixed integer linear programming (MILP) formulations to identify the optimal solutions. A set of different-sized instances are used to test and compare the performance of the proposed models, including some real-world cases. Finally, the proposed exact algorithm is further compared with the existing approach to solving APDP. Results indicate that a significant difference exists in terms of the computational efficiency of the MILP models, while three of four MILP formulations can efficiently achieve better solutions than that of the existing approach.

Suggested Citation

  • Leilei Meng & Biao Zhang & Yaping Ren & Hongyan Sang & Kaizhou Gao & Chaoyong Zhang, 2022. "Mathematical Formulations for Asynchronous Parallel Disassembly Planning of End-of-Life Products," Mathematics, MDPI, vol. 10(20), pages 1-16, October.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:20:p:3854-:d:945305
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/20/3854/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/20/3854/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ren, Yaping & Zhang, Chaoyong & Zhao, Fu & Xiao, Huajun & Tian, Guangdong, 2018. "An asynchronous parallel disassembly planning based on genetic algorithm," European Journal of Operational Research, Elsevier, vol. 269(2), pages 647-660.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bhattacharya, Sourabh & Govindan, Kannan & Ghosh Dastidar, Surajit & Sharma, Preeti, 2024. "Applications of artificial intelligence in closed-loop supply chains: Systematic literature review and future research agenda," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    2. Chang Wook Kang & Muhammad Imran & Muhammad Omair & Waqas Ahmed & Misbah Ullah & Biswajit Sarkar, 2019. "Stochastic-Petri Net Modeling and Optimization for Outdoor Patients in Building Sustainable Healthcare System Considering Staff Absenteeism," Mathematics, MDPI, vol. 7(6), pages 1-26, June.
    3. Lei, Jieyu & Che, Ada & Van Woensel, Tom, 2024. "Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network," European Journal of Operational Research, Elsevier, vol. 313(2), pages 478-493.
    4. Yaping Ren & Xinyu Lu & Hongfei Guo & Zhaokang Xie & Haoyang Zhang & Chaoyong Zhang, 2023. "A Review of Combinatorial Optimization Problems in Reverse Logistics and Remanufacturing for End-of-Life Products," Mathematics, MDPI, vol. 11(2), pages 1-24, January.

    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:gam:jmathe:v:10:y:2022:i:20:p:3854-:d:945305. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.