Input sequencing and scheduling for a reconfigurable manufacturing system with a limited number of fixtures
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yu, Jae-Min | - |
dc.contributor.author | Doh, Hyoung-Ho | - |
dc.contributor.author | Kim, Ji-Su | - |
dc.contributor.author | Kwon, Yong-Ju | - |
dc.contributor.author | Lee, Dong-Ho | - |
dc.contributor.author | Nam, Sung-Ho | - |
dc.date.accessioned | 2021-06-23T03:03:51Z | - |
dc.date.available | 2021-06-23T03:03:51Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2013-07 | - |
dc.identifier.issn | 0268-3768 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/27560 | - |
dc.description.abstract | We consider the input sequencing and scheduling problems in a reconfigurable manufacturing system, a state-of-the-art manufacturing system designed at the outset for rapid changes in its hardware and software components. Due to the inherent operation and routing flexibilities of the system, each part is processed according to a multiple process plan, i.e., each part can be processed through alternative operations, each of which can be processed on alternative machines. The main decisions are: (a) the sequence of parts to be released into the system; (b) the selection of operation/machine pair; and (c) the sequence of the parts assigned to each machine within the system. In particular, we consider the practical constraint that the number of fixtures is limited and hence a part can be released into the system only when the fixture required for the part is available. To solve the integrated input sequencing and scheduling problems, we suggest a practical priority rule based approach in which the three decisions are done using a combination of dispatching rules, i.e., those for input sequencing, operation/machine selection, and part sequencing. To show the performances of various rule combinations, simulation experiments were done on the data derived from a real system, and the test results are reported. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER LONDON LTD | - |
dc.title | Input sequencing and scheduling for a reconfigurable manufacturing system with a limited number of fixtures | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong-Ho | - |
dc.identifier.doi | 10.1007/s00170-013-4761-z | - |
dc.identifier.scopusid | 2-s2.0-84888381781 | - |
dc.identifier.wosid | 000321117300013 | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, v.67, no.1-4, pp.157 - 169 | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | - |
dc.citation.title | INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | - |
dc.citation.volume | 67 | - |
dc.citation.number | 1-4 | - |
dc.citation.startPage | 157 | - |
dc.citation.endPage | 169 | - |
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 | Automation & Control Systems | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Automation & Control Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
dc.subject.keywordPlus | PART MIX RATIOS | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | LOADING PROBLEMS | - |
dc.subject.keywordPlus | TABU SEARCH | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordPlus | INTEGRATION | - |
dc.subject.keywordAuthor | Reconfigurable manufacturing system | - |
dc.subject.keywordAuthor | Input sequencing | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Priority Rules | - |
dc.subject.keywordAuthor | Simulation | - |
dc.identifier.url | https://link.springer.com/article/10.1007/s00170-013-4761-z | - |
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.