390 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author이동호-
dc.date.accessioned2016-08-29T06:16:34Z-
dc.date.available2016-08-29T06:16:34Z-
dc.date.issued2015-03-
dc.identifier.citationINTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v. 53, NO 6, Page. 1819-1831en_US
dc.identifier.issn0020-7543-
dc.identifier.issn1366-588X-
dc.identifier.urihttp://www.tandfonline.com/doi/abs/10.1080/00207543.2014.962112-
dc.identifier.urihttp://hdl.handle.net/20.500.11754/22819-
dc.description.abstractThis study considers a scheduling problem for remanufacturing systems in which end-of-life products are separated into their major components at a disassembly workstation, each of them is reprocessed at its dedicated flow-shop-type reprocessing line with serial workstations, and finally, the reprocessed components, together with new components if required, are reassembled into remanufactured products at a reassembly workstation. Among various system configurations, we focus on the one with parallel flow-shop-type reprocessing lines since it is a typical remanufacturing configuration. The problem is to determine the sequence of products to be disassembled, the sequence of components to be reprocessed at each workstation of flow-shop-type reprocessing lines and the sequence of products to be reassembled for the objective of minimising the total flow time. An integer programming model is developed to represent the problem mathematically, and then, three types of heuristics, i.e. priority rule-based heuristic, Nawaz-Enscore-Ham-based heuristic and iterated greedy algorithm, are proposed due to the problem complexity. To show the performances of the heuristics, a series of computational experiments were done on various test instances, and the results are reported.en_US
dc.description.sponsorshipNational Research Foundation of Korea - Korea government (NRF)en_US
dc.language.isoenen_US
dc.publisherTAYLOR & FRANCIS LTDen_US
dc.subjectflow-shop-type reprocessing linesen_US
dc.subjectschedulingen_US
dc.subjectremanufacturing systemsen_US
dc.subjectheuristicsen_US
dc.titleScheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing linesen_US
dc.typeArticleen_US
dc.relation.no6-
dc.relation.volume53-
dc.identifier.doi10.1080/00207543.2014.962112-
dc.relation.page1819-1831-
dc.relation.journalINTERNATIONAL JOURNAL OF PRODUCTION RESEARCH-
dc.contributor.googleauthorKim, Min-Geun-
dc.contributor.googleauthorYu, Jae-Min-
dc.contributor.googleauthorLee, Dong-Ho-
dc.relation.code2015002918-
dc.sector.campusS-
dc.sector.daehakCOLLEGE OF ENGINEERING[S]-
dc.sector.departmentDEPARTMENT OF INDUSTRIAL ENGINEERING-
dc.identifier.pidleman-
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