Scheduling algorithms to minimise the total family flow time for job shops with job families
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yu, Jae-Min | - |
dc.contributor.author | Kim, Ji-Su | - |
dc.contributor.author | Lee, Dong-Ho | - |
dc.date.accessioned | 2021-06-23T12:07:23Z | - |
dc.date.available | 2021-06-23T12:07:23Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2011-11 | - |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/39241 | - |
dc.description.abstract | This paper considers the job scheduling problem in which jobs are grouped into job families, but they are processed individually. The decision variable is the sequence of the jobs assigned to each machine. This type of job shop scheduling can be found in various production systems, especially in remanufacturing systems with disassembly, reprocessing and reassembly shops. In other words, the reprocessing shop can be regarded as the job shop with job families since it performs the operations required to bring parts or sub-assemblies disassembled back to like-new condition before reassembling them. To minimise the deviations of the job completion times within each job family, we consider the objective of minimising the total family flow time. Here, the family flow time implies the maximum among the completion times of the jobs within a job family. To describe the problem clearly, a mixed integer programming model is suggested and then, due to the complexity of the problem, two types of heuristics are suggested. They are: (a) priority rule based heuristics; and (b) meta-heuristics. Computational experiments were performed on a number of test instances and the results show that some priority rule based heuristics are better than the existing ones. Also, the meta-heuristics improve the priority rule based heuristics significantly. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.title | Scheduling algorithms to minimise the total family flow time for job shops with job families | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong-Ho | - |
dc.identifier.doi | 10.1080/00207543.2010.507609 | - |
dc.identifier.scopusid | 2-s2.0-80053534332 | - |
dc.identifier.wosid | 000299896700016 | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.49, no.22, pp.6885 - 6903 | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.citation.title | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.citation.volume | 49 | - |
dc.citation.number | 22 | - |
dc.citation.startPage | 6885 | - |
dc.citation.endPage | 6903 | - |
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 | DRUM-BUFFER-ROPE | - |
dc.subject.keywordPlus | DISPATCHING RULES | - |
dc.subject.keywordPlus | SEQUENCING RULES | - |
dc.subject.keywordPlus | TABOO SEARCH | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordPlus | POLICIES | - |
dc.subject.keywordAuthor | job shop scheduling | - |
dc.subject.keywordAuthor | job families | - |
dc.subject.keywordAuthor | total family flow time | - |
dc.subject.keywordAuthor | priority rules | - |
dc.subject.keywordAuthor | meta-heuristics | - |
dc.identifier.url | https://www.tandfonline.com/doi/full/10.1080/00207543.2010.507609 | - |
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.