Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jun-Gyu | - |
dc.contributor.author | Lee, Dong Ho | - |
dc.date.accessioned | 2022-12-20T21:15:36Z | - |
dc.date.available | 2022-12-20T21:15:36Z | - |
dc.date.created | 2022-08-26 | - |
dc.date.issued | 2009-09 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/176308 | - |
dc.description.abstract | This paper focuses on the single machine sequencing and common due-date assignment problem for the objective of minimizing the sum of the penalties associated with earliness, tardiness and due-date assignment. Unlike the previous research articles on this class of scheduling problem, we consider sequence-dependent setup times that make the problem much more difficult. To solve the problem, a branch and bound algorithm, which incorporates the method to obtain lower and upper bounds as well as a dominance property to reduce the search space, is suggested that gives the optimal solutions for small-sized instances. Heuristic algorithms are suggested to obtain solutions for large-sized problems within a reasonable computation time. The performances of both the optimal and heuristic algorithms, in computational experiments on randomly generated test instances, are reported. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.title | Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong Ho | - |
dc.identifier.doi | 10.1057/jors.2008.95 | - |
dc.identifier.scopusid | 2-s2.0-68649085140 | - |
dc.identifier.wosid | 000268641100014 | - |
dc.identifier.bibliographicCitation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.60, no.9, pp.1264 - 1272 | - |
dc.relation.isPartOf | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.citation.title | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.citation.volume | 60 | - |
dc.citation.number | 9 | - |
dc.citation.startPage | 1264 | - |
dc.citation.endPage | 1272 | - |
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 | Business & Economics | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Management | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | PROCESSING TIMES | - |
dc.subject.keywordPlus | SCHEDULING PROBLEM | - |
dc.subject.keywordPlus | PARALLEL MACHINES | - |
dc.subject.keywordPlus | TARDINESS PENALTIES | - |
dc.subject.keywordPlus | READY TIMES | - |
dc.subject.keywordPlus | EARLINESS | - |
dc.subject.keywordPlus | MINIMIZE | - |
dc.subject.keywordAuthor | sequencing | - |
dc.subject.keywordAuthor | common due-date assignment | - |
dc.subject.keywordAuthor | sequence-dependent setup time | - |
dc.identifier.url | https://www.tandfonline.com/doi/full/10.1057/jors.2008.95 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.