Skip to main content
Log in

Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

Due to increasing environmental concerns, manufacturers are forced to take back their products at the end of products’ useful functional life. Manufacturers explore various options including disassembly operations to recover components and subassemblies for reuse, remanufacture, and recycle to extend the life of materials in use and cut down the disposal volume. However, disassembly operations are problematic due to high degree of uncertainty associated with the quality and configuration of product returns. In this research we address the disassembly line balancing problem (DLBP) using a Monte-Carlo based reinforcement learning technique. This reinforcement learning approach is tailored fit to the underlying dynamics of a DLBP. The research results indicate that the reinforcement learning based method is able to perform effectively, even on a complex large scale problem, within a reasonable amount of computational time. The proposed method performed on par or better than the benchmark methods for solving DLBP reported in the literature. Unlike other methods which are usually limited deterministic environments, the reinforcement learning based method is able to operate in deterministic as well as stochastic environments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  • Agarwal, S., & Tiwari, M. K. (2006). A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem. International Journal of Production, 46, 1405–1429.

    Article  Google Scholar 

  • Aissani, N., Bekrar, A., & et al. (2011). Dynamic scheduling for multi-site companies: a decisional approach based on reinforcement multi-agent learning. Journal of Intelligent Manufacturing: in press.

  • Altekin, F. T., Kandiller, L., et al. (2008). Profit-oriented disassembly line balancing. International Journal of Production Research, 46, 2675–2693.

    Google Scholar 

  • Banda, K., & Zeid, I. (2006). To disassemble or not: A computational methodology for decision making. Journal of Intelligent Manufacturing, 17(5), 621–634.

    Article  Google Scholar 

  • Giudice, F., & Fargione, G. (2007). Disassembly planning of mechanical systems for service and recovery: A genetic algorithms based approach. Journal of Intelligent Manufacturing, 18(3), 313–329.

    Article  Google Scholar 

  • Gungor, A., & Gupta, S. (2002). Disassembly line in product recovery. International Journal of Production Research, 40(11), 2569–2589.

    Article  Google Scholar 

  • Gungor, A., & Gupta, S. M. (1999a). Disassembly line balancing. In Proceedings of the 1999 annual meeting of the northeast decision sciences, RI, Newport.

  • Gungor, A., & Gupta, S. M. (1999b). Issues in environmentally concious manufacturing and product recovery: A survey. Computers and Industrial Engineering, 36, 811–853.

    Article  Google Scholar 

  • Gungor, A., Gupta, S. M., & et al. (2001). Complications in disassembly line balancing. In Proceedings of SPIE—the international society for optical engineering, SPIE.

  • Gupta, S. M., Erbis, E., & et al. (2004). Disassembly sequencing problem: A case study of a cell phone. In Proceedings of SPIE—The international society for optical engineering, SPIE.

  • Gupta, S. M., & Gungor, A. (2001). Product recovery using a disassembly line: Challenges and solution. In IEEE international symposium on electronics and the environment, Institute of Electrical and Electronics Engineers Inc.

  • Gupta, S. M., & Lambert, A. J. D. (2008). Environment conscious manufacturing. Boca Raton: CRC Press.

    Google Scholar 

  • Homem de Mello, L. S., & Sanderson, A. C. (1990). AND/OR graph representation of assembly plans. IEEE Transactions on Robotics and Automation, 6(2), 188–199.

    Article  Google Scholar 

  • Kizilkaya, E. A., & Gupta, S. M. (2005). Impact of different disassembly line balancing algorithms on the performance of dynamic kanban system for disassembly line. In Proceedings of the SPIE—the international society for optical engineering, SPIE, USA.

  • Kongar, E., & Gupta, S. M. (2006). Disassembly sequencing using genetic algorithm. Internationl Journal of Advanced Manufacturing Technology, 30(5–6), 497–506.

    Article  Google Scholar 

  • Lambert, A. J. D. (2001). Optimum disassembly sequence generation. Environmentally conscious manufacturing. In Proceedings of SPIE—the international society for optical engineering, Vol. 4193, pp. 56–67.

  • Lambert, A. J. D. (2007). Optimizing disassembly processes subjected to sequence-dependent cost. Computers and Operations Research, 34(2), 536–551.

    Article  Google Scholar 

  • Lambert, A. J. D., Gupta, S. M. (2005a). Determining optimum and suboptimum disassembly sequences with an application to a cell phone. In Proceedings of the IEEE international symposium on assembly and task planning, Institute of Electrical and Electronics Engineers Computer Society.

  • Lambert, A. J. D., & Gupta, S. M. (2005b). Disassembly modeling for assembly, maintenance, and reuse. New York: CRC.

    Google Scholar 

  • Martinez, M., Pham, F., et al. (2009). Optimal assembly plan generation: A simplifying approach. Journal of Intelligent Manufacturing, 20(1), 15–27.

    Google Scholar 

  • McGovern, S., Gupta, S. M. (2004a) Combinatorial optimization methods for disassembly line balancing. In Proceedings of the 2004 SPIE international conference on enviromentally conscious manufacturing, Philadelphia.

  • McGovern, S., & Gupta, S. M. (2007a). A balancing method and genetic algorithm for disassembly line balancing. European Journal of Operational Research, 179, 692–708.

    Article  Google Scholar 

  • McGovern, S. M., & Gupta, S. M. (2004b). 2-Opt Heuristic for the Disassembly Line Balancing Problem. In Proceedings of SPIE—the international society for optical engineering, SPIE.

  • McGovern, S. M., & Gupta, S. M. (2007b). Combinatorial optimization analysis of unary NP-complete disassembly line balancing problem. International Journal of Production Research, 45(18–19), 4485–4511.

    Google Scholar 

  • McGovern, S. M., & Gupta, S. M. (2011). The disassembly line—balancing and modeling. New York City: McGraw-Hill.

    Google Scholar 

  • Pan, L., & Zeid, I. (2001). A knowledge base for indexing and retrieving disassembly plans. Journal of Intelligent Manufacturing, 12(1), 77–94.

    Article  Google Scholar 

  • Reveliotis, S. A. (2007). Uncertainty management in optimal disassembly planning through learning-based strategies. IIE Transactions, 39(6), 645–658.

    Article  Google Scholar 

  • Russell, S., & Norvig, P. (1995). Artificial intelligence: A modern approach. Eaglewood Cliffs, New Jersey: Prentice Hall.

    Google Scholar 

  • Seo, K.-K., Park, J.-H., et al. (2001). Optimal disassembly sequence using genetic algorithms considering economic and environmental aspects. International Journal of Advanced Manufacturing Technology, 18, 371–380.

    Google Scholar 

  • Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction. Cambridge, Massachusetts: The MIT Press.

    Google Scholar 

  • Tadao, M. (1989). Petri nets: properties, analysis and applications. In Proceedings of the IEEE.

  • Tang, Y., & MengChu, Z. (2006). A systematic approach to design and operation of disassembly lines. IEEE Transactions on Automation Science and Engineering, 3(3), 324–329.

    Article  Google Scholar 

  • Tang, Y., Zhou, M., et al. (2002). Disassembly modeling, plannig, and application. Journal of Manufacturing Systems, 2(3), 200–217.

    Google Scholar 

  • Tewari, A. (2007). Reinforcement learning in large or unknown MDPs. Ph.D: Dissertation, University of California, Berkeley.

  • Turowski, M., Morgan, M., & et al. (2005). Disassembly line design with uncertainty. In Conference proceedings—IEEE international conference on systems, man and cybernetics, Institute of Electrical and Electronics Engineers Inc.

  • Veerakamolmal, P., & Gupta, S. M. (2002). A case-based reasoning approach for automating disassembly process planning. Journal of Intelligent Manufacturing, 13(1), 47–60.

    Article  Google Scholar 

  • Watkins, C., & Dayan, P. (1992). Q-learning. Machine Learning, 8(3), 279–292.

    Google Scholar 

  • Watkins, C. J. C. H. (1989). Learning from Delayed Rewards. Ph.D. thesis. U.K., Cambridge University.

  • Zeid, I., Gupta, S., et al. (1997). A case-based reasoning approach to planning for disassembly. Journal of Intelligent Manufacturing, 8(2), 97–106.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Abe Zeid.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tuncel, E., Zeid, A. & Kamarthi, S. Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning. J Intell Manuf 25, 647–659 (2014). https://doi.org/10.1007/s10845-012-0711-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-012-0711-0

Keywords

Navigation