Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yu, Jae-Min | - |
dc.contributor.author | Lee, Dong-Ho | - |
dc.date.accessioned | 2021-06-22T13:04:43Z | - |
dc.date.available | 2021-06-22T13:04:43Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2018 | - |
dc.identifier.issn | 1751-5254 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/8053 | - |
dc.description.abstract | This study addresses a job shop scheduling problem in which jobs are grouped into job families, but they are processed individually using their distinct routings. Unlike the previous studies, we consider a due-date-based objective of minimising the total family tardiness, i.e., sum of positive deviations between the due-dates and the completion times of job families. A mixed integer programming model is developed to represent the problem mathematically. Then, an optimal algorithm is proposed using the branch and bound technique while developing a job family-based lower bound. For practical applications up to large sized instances, two types of heuristics, modified shifting bottleneck and priority scheduling algorithms, are also proposed. To test the performances of the three types of solution algorithms, computational experiments were done on a number of test instances and the results are reported. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | INDERSCIENCE ENTERPRISES LTD | - |
dc.title | Solution algorithms to minimise the total family tardiness for job shop scheduling with job families | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong-Ho | - |
dc.identifier.doi | 10.1504/EJIE.2018.089876 | - |
dc.identifier.scopusid | 2-s2.0-85042625443 | - |
dc.identifier.wosid | 000427174700001 | - |
dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, v.12, no.1, pp.1 - 23 | - |
dc.relation.isPartOf | EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING | - |
dc.citation.title | EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING | - |
dc.citation.volume | 12 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 23 | - |
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 | Operations Research & Management Science | - |
dc.subject.keywordPlus | TOTAL WEIGHTED TARDINESS | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordAuthor | job shop scheduling | - |
dc.subject.keywordAuthor | job families | - |
dc.subject.keywordAuthor | family tardiness | - |
dc.subject.keywordAuthor | branch and bound | - |
dc.subject.keywordAuthor | heuristics | - |
dc.identifier.url | https://www.inderscienceonline.com/doi/abs/10.1504/EJIE.2018.089876 | - |
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.