Selective disassembly sequencing with random operation times in parallel disassembly environment

Citations

WEB OF SCIENCE

43
Citations

SCOPUS

53

초록

Selective disassembly sequencing is the problem of determining the sequence of disassembly operations to extract one or more target components of a product. This study considers the problem with random operation times in the parallel disassembly environment in which one or more components can be removed at the same time by a single disassembly operation. After representing all possible disassembly sequences using the extended process graph, a stochastic integer programming model is developed for the objective of minimising the sum of disassembly and penalty costs, where the disassembly costs consist of sequence-dependent set-up and operation costs and the penalty cost is the expectation of the costs incurred when the total disassembly time exceeds a threshold value. A sample average approximation-based solution algorithm is proposed that incorporates an optimal algorithm to solve the sample average approximating problem under a given set of scenarios for disassembly operation times. The algorithm is illustrated with a hand-light case and a large-sized random instance, and the results are reported.

키워드

disassembly planning; selective disassembly sequencing; random operation times; parallel disassembly; sample average approximation; PRODUCT; ALGORITHM; SEARCH; DESIGN; MODEL; PARTS; COST
제목
Selective disassembly sequencing with random operation times in parallel disassembly environment
저자
Kim, Hyung-Won; Park, Chuljin; Lee, Dong-Ho
DOI
10.1080/00207543.2018.1432911
발행일
2018-12
유형
Article
저널명
International Journal of Production Research
권
56
호
24
페이지
7243 ~ 7257