Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012 pp 519–525Cite as

A New Heuristic for Disassembly Line Balancing Problems with AND/OR Precedence Relations

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 236))

Abstract

Disassembly operations are inevitable elements of product recovery with the disassembly line as the best choice to carry out the same. The product recovery operations are fully based on disassembly line balancing and because of this, disassembly lines have become the chaise of automated disassembly of returned product. It is difficult to find the optimal balance of a disassembly line because of its N-P hard nature. In this paper a new heuristic is proposed to assign the parts to the disassembly workstations under AND/OR precedence constraints. The heuristic solutions are known as intrinsically optimal/suboptimal solutions of the N-P hard problems. The solution obtained by proposed heuristic has been compared with other heuristic solutions. The heuristic tries to minimize the number of workstations and the cycle time of the line while addressing the different criteria. The methodology of the proposed heuristics has been illustrated with the help of examples and it has been observed that the heuristic generates significantly better result.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Zhang, H.C., Kuo, T.C., Lu, H., Huang, S.H.: Environmentally conscious Design and Manufacturing: a state-of-the-art survey. J. Manuf. Syst. 16(5), 352–371 (1997)

    Article  Google Scholar 

  2. Gupta, S.M., Taleb, K.N.: Scheduling disassembly. Int. J. Prod. Res. 32, 1857–1866 (1994)

    Article  MATH  Google Scholar 

  3. McGovern, S.M., Gupta, S.M.: 2-opt heuristic for the disassembly line balancing problem. Iris Northeastern University, Boston (2003)

    Google Scholar 

  4. Gupta, S.M., Lambert, A.J.D.: A heuristic solution for disassembly line balancing problem incorporating sequence dependent costs. Iris Northeastern University, Boston (2005)

    Google Scholar 

  5. Gungor, A., Gupta, S.M.: Issues in environmentally conscious manufacturing and product recovery: a survey. Comput. Ind. Eng. 36(4), 811–853 (1999a)

    Article  Google Scholar 

  6. Gungor, A., Gupta, S. M.: Disassembly line balancing. In: Proceedings of the 1999 Annual Meeting of the Northeast Decision Sciences Institute, Newport, Rhode Island, 193–195 March 1999b

    Google Scholar 

  7. Gungor, A., Gupta, S.M.: Disassembly line in product recovery. Int. J. Prod. Res. 40(11), 2569–2589 (2002)

    Article  Google Scholar 

  8. Tiwari, M.K., Sinha, N., Kumar, S., Rai, R., Mukhopadhyay, S.K.: A petri net based approach to determine strategy of a product. Int. J. Prod. Res. 40(5), 1113–1129 (2001)

    Article  Google Scholar 

  9. McGovern, S.M., Gupta, S.M.: Combinatorial optimization methods for disassembly line balancing. In: Proceedings of the 2004 SPIE International Conference on Environmentally Conscious Manufacturing, Philadelphia, Pennsylvania, 53–66 (2004)

    Google Scholar 

  10. McGovern, S.M., Gupta, S.M.: A balancing method and genetic algorithm for disassembly line balancing. Eur. J. Oper. Res. 179, 692–708 (2007)

    Article  MATH  Google Scholar 

  11. Altekin, F.T., et al.: Profit-oriented disassembly-line balancing. Int. J. Prod. Res. 46, 2675–2693 (2008)

    Article  MATH  Google Scholar 

  12. Koc, A., Sabuncuoglu, I., Erel, E.: Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph. IIE Trans. Oper. Eng. 41, 866–881 (2009)

    Article  Google Scholar 

  13. Ding, L.-P., et al.: A new multi-objective ant colony algorithm for solving the disassembly line balancing problems. Int. J. Adv. Manuf. Technol. 48, 761–771 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Motilal Nehru National Institute of Technology, Allahabad, India

    Shwetank Avikal, Rajeev Jain, Harish Yadav & P. K. Mishra

Authors
  1. Shwetank Avikal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajeev Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Harish Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P. K. Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shwetank Avikal .

Editor information

Editors and Affiliations

  1. Institute of Engineering and Technology, JK Lakshmipat University, Jaipur, Rajasthan, India

    B. V. Babu

  2. Department of Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

  3. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Kusum Deep

  4. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, India

    Millie Pant

  5. Department of Applied Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

  6. Institute of Engineering and Technology, JK Lakshmipat University, Jaipur, Rajasthan, India

    Kanad Ray

  7. Institute of Engineering and Technology, JK Lakshmipat University, Jaipur, Rajasthan, India

    Umesh Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Avikal, S., Jain, R., Yadav, H., Mishra, P.K. (2014). A New Heuristic for Disassembly Line Balancing Problems with AND/OR Precedence Relations. In: Babu, B., et al. Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012. Advances in Intelligent Systems and Computing, vol 236. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1602-5_55

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1602-5_55

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1601-8

  • Online ISBN: 978-81-322-1602-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation