A priority scheduling approach for flexible job shops with multiple process plans
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Doh, Hyoung-Ho | - |
dc.contributor.author | Yu, Jae-Min | - |
dc.contributor.author | Kim, Ji-Su | - |
dc.contributor.author | Lee, Dong-Ho | - |
dc.contributor.author | Nam, Sung-Ho | - |
dc.date.accessioned | 2021-06-23T03:05:35Z | - |
dc.date.available | 2021-06-23T03:05:35Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2013-06 | - |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/27619 | - |
dc.description.abstract | This paper considers the job shop scheduling problem with alternative operations and machines, called the flexible job shop scheduling problem. As an extension of previous studies, operation and routing flexibilities are considered at the same time in the form of multiple process plans, i.e. each job can be processed through alternative operations, each of which can be processed on alternative machines. The main decisions are: (a) selecting operation/machine pair; and (b) sequencing the jobs assigned to each machine. Since the problem is highly complicated, we suggest a practical priority scheduling approach in which the two decisions are done at the same time using a combination of operation/machine selection and job sequencing rules. The performance measures used are minimising makespan, total flow time, mean tardiness, the number of tardy jobs, and the maximum tardiness. To compare the performances of various rule combinations, simulation experiments were done on the data for hybrid systems with an advanced reconfigurable manufacturing system and a conventional legacy system, and the results are reported. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.title | A priority scheduling approach for flexible job shops with multiple process plans | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong-Ho | - |
dc.identifier.doi | 10.1080/00207543.2013.765074 | - |
dc.identifier.scopusid | 2-s2.0-84880249924 | - |
dc.identifier.wosid | 000320918900019 | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.51, no.12, pp.3748 - 3764 | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.citation.title | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.citation.volume | 51 | - |
dc.citation.number | 12 | - |
dc.citation.startPage | 3748 | - |
dc.citation.endPage | 3764 | - |
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 | TABU SEARCH | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | INTEGRATION | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordAuthor | flexible job shop scheduling | - |
dc.subject.keywordAuthor | multiple process plans | - |
dc.subject.keywordAuthor | priority rules | - |
dc.subject.keywordAuthor | simulation | - |
dc.identifier.url | https://www.tandfonline.com/doi/full/10.1080/00207543.2013.765074 | - |
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.