9 0

Selective disassembly sequencing with random operation times in parallel disassembly environment

Title
Selective disassembly sequencing with random operation times in parallel disassembly environment
Author
박철진
Keywords
disassembly planning; selective disassembly sequencing; random operation times; parallel disassembly; sample average approximation
Issue Date
2018-12
Publisher
TAYLOR & FRANCIS LTD
Citation
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v. 56, no. 24, page. 7243-7257, Special no. SI
Abstract
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.
URI
https://www.tandfonline.com/doi/full/10.1080/00207543.2018.1432911http://repository.hanyang.ac.kr/handle/20.500.11754/120906
ISSN
0020-7543; 1366-588X
DOI
10.1080/00207543.2018.1432911
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE