상세 보기
Selective disassembly sequencing with random operation times in parallel disassembly environment
- Kim, Hyung-Won;
- Park, Chuljin;
- Lee, Dong-Ho
WEB OF SCIENCE
43SCOPUS
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.
키워드
- 제목
- Selective disassembly sequencing with random operation times in parallel disassembly environment
- 저자
- Kim, Hyung-Won; Park, Chuljin; Lee, Dong-Ho
- 발행일
- 2018-12
- 유형
- Article
- 권
- 56
- 호
- 24
- 페이지
- 7243 ~ 7257
- 언어
- ENG
- 출판사
- TAYLOR & FRANCIS LTD
- 발행국가
- 영국
- 분량
- 15 페이지
- ISSN
- E 1366-588X
P 0020-7543