<title>Complications in disassembly line balancing</title>
Author(s) -
Aşkıner Güngör,
Surendra M. Gupta,
Kishore K. Pochampally,
Sagar Kamarthi
Publication year - 2001
Publication title -
proceedings of spie, the international society for optical engineering/proceedings of spie
Language(s) - English
Resource type - Conference proceedings
SCImago Journal Rank - 0.192
H-Index - 176
eISSN - 1996-756X
pISSN - 0277-786X
DOI - 10.1117/12.417274
Subject(s) - heuristic , line (geometry) , computer science , assembly line , process (computing) , work (physics) , distributed computing , industrial engineering , engineering , artificial intelligence , mechanical engineering , operating system , mathematics , geometry
Disassembly line is, perhaps, the most suitable way for the disassembly of large products or small products in large quantities. In this paper, we address the disassembly line balancing problem (DLBP) and the challenges that come with it. The objective of balancing the disassembly line is to utilize the disassembly line in an optimized fashion while meeting the demand for the parts retrieved from the returned products. Although, the traditional line balancing problem for assembly has been studied for a long time, so far, no one has formally talked about the DLBP. In this work, our primary objective is to address the DLBP related issues. However, we also present a heuristic to demonstrate how several important factors in disassembly can be incorporated into the solution process of a DLBP. An example is considered to illustrate the use of the heuristic.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom