Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Min-Geun | - |
dc.contributor.author | Yu, Jae-Min | - |
dc.contributor.author | Lee, Dong-Ho | - |
dc.date.accessioned | 2021-06-22T20:22:41Z | - |
dc.date.available | 2021-06-22T20:22:41Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2015-03 | - |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/18784 | - |
dc.description.abstract | This 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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.title | Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong-Ho | - |
dc.identifier.doi | 10.1080/00207543.2014.962112 | - |
dc.identifier.scopusid | 2-s2.0-84922224939 | - |
dc.identifier.wosid | 000348674400012 | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.53, no.6, pp.1819 - 1831 | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.citation.title | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.citation.volume | 53 | - |
dc.citation.number | 6 | - |
dc.citation.startPage | 1819 | - |
dc.citation.endPage | 1831 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | ITERATED GREEDY ALGORITHM | - |
dc.subject.keywordPlus | DRUM-BUFFER-ROPE | - |
dc.subject.keywordPlus | ASSEMBLY FLOWSHOP | - |
dc.subject.keywordPlus | MAXIMUM LATENESS | - |
dc.subject.keywordPlus | PRODUCT RECOVERY | - |
dc.subject.keywordPlus | MINIMIZE | - |
dc.subject.keywordPlus | MAKESPAN | - |
dc.subject.keywordPlus | POLICIES | - |
dc.subject.keywordPlus | TIME | - |
dc.subject.keywordAuthor | flow-shop-type reprocessing lines | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | remanufacturing systems | - |
dc.subject.keywordAuthor | heuristics | - |
dc.identifier.url | https://www.tandfonline.com/doi/full/10.1080/00207543.2014.962112 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.