DocumentCode :
1868735
Title :
A bin assignment algorithm for demanufacturing automation
Author :
Gao, Meimei ; Zhou, MengChu ; Caudill, Reggie J.
Author_Institution :
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
Volume :
3
fYear :
2002
fDate :
2002
Firstpage :
2351
Lastpage :
2356
Abstract :
An algorithm is developed to determine disassembly levels and bins to maximize the profit from a used product through balancing the resource invested in disassembly processes, the return realized from them and the environmental impact. The algorithm utilizes the information from a computer aided design (CAD) system and requires minimal user input with the computational complexity of O(n), where n is the number of parts and final subassemblies in a product. It has been successfully used in the development of a demanufacturing stage of a multilifecycle assessment and analysis (MLCA) tool. The benefit of the proposed algorithm is illustrated through an example
Keywords :
CAD; computational complexity; computer aided production planning; optimisation; recycling; CAD system; MLCA tool; bin assignment algorithm; computational complexity; demanufacturing automation; disassembly levels; profit maximization; subassemblies; Algorithm design and analysis; Computational complexity; Design automation; Graph theory; Hazardous materials; Process planning; Profitability; Protection; Recycling; Sustainable development;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Robotics and Automation, 2002. Proceedings. ICRA '02. IEEE International Conference on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7272-7
Type :
conf
DOI :
10.1109/ROBOT.2002.1013583
Filename :
1013583
Link To Document :
بازگشت