Skip to content
naulon
Not checkedNot checked for notices yet.

Disassembly parts selection and analysis for recycling rate and cost by goal programming

Yuki KINOSHITA, Tetsuo YAMADA, Surendra M. GUPTA and 2 more

Journal of Advanced Mechanical Design, Systems, and Manufacturing · 2016

doi:10.1299/jamdsm.2016jamdsm0052 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

For green supply chains, it is essential to disassemble and recycle end-of-life (EOL) assembled products for material circulation. In order to establish disassembly plants environmentally friendly and economical manner, a disassembly parts selection is often carried out. Each part has a different recycling rate and cost, and all parts have precedence relationships among disassembly tasks. Igarashi et al. (2014) [International Journal of Industrial Engineering and Management Systems, Vol.13, No.1, pp.52-66] proposed a disassembly parts selection method that is carried out in an environmentally friendly and economical manner with non-destructive or destructive disassembly with integer programming with ε constraint. However, calculated efforts are required to achieve optimum solutions for the ε constraint method. On the other hand, goal programming is well known as an effective way to solve multi-criteria decision-making problems. This study proposes a bi-objective disassembly parts selection with recycling rate and cost using goal programming, and analyzes multiple types of EOL assembled products and disassembly parts selection. First, an environmentally friendly and economical disassembly parts selection is addressed using a 3D-CAD and Recyclability Evaluation Method (REM) developed by Hitachi Ltd. Next, the environmentally friendly and economical disassembly parts selection is formulated with goal programming. Finally, a case study is quantitatively discussed by comparing different types of assembled products and goal programming parameters. It is demonstrated that the proposal method by goal programming in this study finds the same solutions with the lower number of numerical experiments as that with the ε constraint method.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.