299 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author이동호-
dc.date.accessioned2019-12-10T15:40:59Z-
dc.date.available2019-12-10T15:40:59Z-
dc.date.issued2018-12-
dc.identifier.citationINTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v. 56, no. 24, page. 7243-7257, Special no. SIen_US
dc.identifier.issn0020-7543-
dc.identifier.issn1366-588X-
dc.identifier.urihttps://www.tandfonline.com/doi/full/10.1080/00207543.2018.1432911-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/120997-
dc.description.abstractSelective 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.en_US
dc.description.sponsorshipThis work was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education of Korea Government [grant number 2015R1D1A1A01057669].en_US
dc.language.isoen_USen_US
dc.publisherTAYLOR & FRANCIS LTDen_US
dc.subjectdisassembly planningen_US
dc.subjectselective disassembly sequencingen_US
dc.subjectrandom operation timesen_US
dc.subjectparallel disassemblyen_US
dc.subjectsample average approximationen_US
dc.titleSelective disassembly sequencing with random operation times in parallel disassembly environmenten_US
dc.typeArticleen_US
dc.relation.no24-
dc.relation.volume56-
dc.identifier.doi10.1080/00207543.2018.1432911-
dc.relation.page7243-7257-
dc.relation.journalINTERNATIONAL JOURNAL OF PRODUCTION RESEARCH-
dc.contributor.googleauthorKim, Hyung-Won-
dc.contributor.googleauthorPark, Chuljin-
dc.contributor.googleauthorLee, Dong-Ho-
dc.relation.code2018003024-
dc.sector.campusS-
dc.sector.daehakCOLLEGE OF ENGINEERING[S]-
dc.sector.departmentDEPARTMENT OF INDUSTRIAL ENGINEERING-
dc.identifier.pidleman-
dc.identifier.researcherIDP-2938-2018-
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