IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v269y2018i2p647-660.html
   My bibliography  Save this article

An asynchronous parallel disassembly planning based on genetic algorithm

Author

Listed:
  • Ren, Yaping
  • Zhang, Chaoyong
  • Zhao, Fu
  • Xiao, Huajun
  • Tian, Guangdong

Abstract

Disassembly is one of the most crucial remanufacturing activities. Disassembly sequence planning (DSP) is a combinatorial optimization problem and has been studied by many researchers. Conventional DSP techniques focus on sequential disassembly planning (SDP) in which only one manipulator is used to remove a single part or subassembly at a time such that it is inefficient when disassembling large or complex products. Recently, parallel disassembly has attracted some interest as it employs several manipulators to remove multiple components simultaneously. However, most of the work to date focuses on parallel disassembly techniques which require synchronization between manipulators, i.e., they must start their tasks simultaneously. This simplifies the modeling and analysis efforts but fails to fully realize the benefits of parallel disassembly. In this work, we propose asynchronous parallel disassembly planning (aPDP) which eliminates the synchronization requirement. In addition to precedence constraints, aPDP becomes highly operation time-dependent. To deal with this, we design an efficient encoding and decoding strategy for the disassembly process. In this paper, a metaheuristic approach, based on a genetic algorithm, is developed to solve the aPDP problem. The proposed algorithm is applied to four products which require disassembly processes of varying complexity, and the results are compared with two methods reported in literature. It is suggested that the proposed approach can identify faster disassembly processes, especially when solving large-scale problems.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:269:y:2018:i:2:p:647-660
    DOI: 10.1016/j.ejor.2018.01.055
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Panwalkar, S.S., 2016. "The proportionate two-machine no-wait job shop scheduling problemAuthor-Name: Koulamas, Christos," European Journal of Operational Research, Elsevier, vol. 252(1), pages 131-135.
    2. Moore, Kendra E. & Gungor, Askiner & Gupta, Surendra M., 2001. "Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships," European Journal of Operational Research, Elsevier, vol. 135(2), pages 428-449, December.
    3. Ondemir, Onder & Gupta, Surendra M., 2014. "A multi-criteria decision making model for advanced repair-to-order and disassembly-to-order system," European Journal of Operational Research, Elsevier, vol. 233(2), pages 408-419.
    4. Yaping Ren & Daoyuan Yu & Chaoyong Zhang & Guangdong Tian & Leilei Meng & Xiaoqiang Zhou, 2017. "An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 55(24), pages 7302-7316, December.
    5. Hyung-Won Kim & Dong-Ho Lee, 2017. "An optimal algorithm for selective disassembly sequencing with sequence-dependent set-ups in parallel disassembly environment," International Journal of Production Research, Taylor & Francis Journals, vol. 55(24), pages 7317-7333, December.
    6. Goncalves, Jose Fernando & de Magalhaes Mendes, Jorge Jose & Resende, Mauricio G. C., 2005. "A hybrid genetic algorithm for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 167(1), pages 77-95, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    3. 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.

    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. Mehmet Talha Dulman & Surendra M. Gupta, 2018. "Evaluation of Maintenance and EOL Operation Performance of Sensor-Embedded Laptops," Logistics, MDPI, vol. 2(1), pages 1-22, January.
    2. Ivorra, Benjamin & Mohammadi, Bijan & Manuel Ramos, Angel, 2015. "A multi-layer line search method to improve the initialization of optimization algorithms," European Journal of Operational Research, Elsevier, vol. 247(3), pages 711-720.
    3. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    4. Özden Tozanlı & Elif Kongar & Surendra M. Gupta, 2020. "Evaluation of Waste Electronic Product Trade-in Strategies in Predictive Twin Disassembly Systems in the Era of Blockchain," Sustainability, MDPI, vol. 12(13), pages 1-33, July.
    5. Ondemir, Onder & Gupta, Surendra M., 2014. "A multi-criteria decision making model for advanced repair-to-order and disassembly-to-order system," European Journal of Operational Research, Elsevier, vol. 233(2), pages 408-419.
    6. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    7. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    8. Chiang, Tsung-Che & Fu, Li-Chen, 2009. "Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 196(1), pages 78-92, July.
    9. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    10. Hong-Sen Yan & Wen-Chao Li, 2017. "A multi-objective scheduling algorithm with self-evolutionary feature for job-shop-like knowledgeable manufacturing cell," Journal of Intelligent Manufacturing, Springer, vol. 28(2), pages 337-351, February.
    11. Seung-Hyun Moon & Yourim Yoon, 2022. "Genetic Mean Reversion Strategy for Online Portfolio Selection with Transaction Costs," Mathematics, MDPI, vol. 10(7), pages 1-20, March.
    12. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    13. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1353-1374, December.
    14. Muris Lage Junior & Moacir Godinho Filho, 2017. "Master disassembly scheduling in a remanufacturing system with stochastic routings," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(1), pages 123-138, March.
    15. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    16. Liang, Wei & Zhang, Zeqiang & Yin, Tao & Zhang, Yu & Wu, Tengfei, 2023. "Modelling and optimisation of energy consumption and profit-oriented multi-parallel partial disassembly line balancing problem," International Journal of Production Economics, Elsevier, vol. 262(C).
    17. Thi-Kien Dao & Tien-Szu Pan & Trong-The Nguyen & Jeng-Shyang Pan, 2018. "Parallel bat algorithm for optimizing makespan in job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 451-462, February.
    18. Gabriel H Greve & Kenneth M Hopkinson & Gary B Lamont, 2018. "Evolutionary sensor allocation for the Space Surveillance Network," The Journal of Defense Modeling and Simulation, , vol. 15(3), pages 303-322, July.
    19. Mauricio Resende, 2012. "Biased random-key genetic algorithms with applications in telecommunications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 130-153, April.
    20. Meng, Kai & Cao, Ying & Peng, Xianghui & Prybutok, Victor & Gupta, Varun, 2020. "Demand-dependent recovery decision-making of a batch of products for sustainability," International Journal of Production Economics, Elsevier, vol. 224(C).

    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:269:y:2018:i:2:p:647-660. 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: 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.