The disassembly line balancing problem of type II

DOI

10.2991/jimec-18.2018.6How to use a DOI?

Keywords

disassembly; disassembly line balancing problem; type II; cycle time; variable neighborhood search

Abstract

Product disassembly is a vital stage for industrial recycling and remanufacturing which generates the desired parts/subassemblies by means of separation of a product into its elements. After disassembly, reusable parts/subassemblies are cleaned, refurbished, tested and directed to the part/subassembly inventory for remanufacturing process. The recyclable materials are sold to raw-material suppliers, while the residuals are sent to landfills. The disassembly line is the most suitable setting to disassemble products on a large scale. Therefore, designing and balancing disassembly line is important to improve the disassembly efficiency and realize the disassembly industrialization. In this study, we deal with the problem of disassembly line balancing with fixed number of workstations. A disassembly line balancing problem of type II (DLBP-II) is presented to minimize the cycle time and ensure the balance of workloads among workstations, and an improved variable neighborhood search algorithm is proposed to solve it. Finally, the validity of the presented model and the performance of the proposed algorithm are tested by different scale instances.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Wang Shuwei
AU  - Guo Xiuping
AU  - Liu Jia
PY  - 2018/12
DA  - 2018/12
TI  - The disassembly line balancing problem of type II
BT  - Proceedings of the 2018 3rd Joint International Information Technology，Mechanical and Electronic Engineering Conference (JIMEC 2018)
PB  - Atlantis Press
SP  - 27
EP  - 31
SN  - 2589-4943
UR  - https://doi.org/10.2991/jimec-18.2018.6
DO  - 10.2991/jimec-18.2018.6
ID  - Shuwei2018/12
ER  -