Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times
- Authors
- Kim, Jun-Gyu; Lee, Dong Ho
- Issue Date
- Sep-2009
- Publisher
- TAYLOR & FRANCIS LTD
- Keywords
- sequencing; common due-date assignment; sequence-dependent setup time
- Citation
- JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.60, no.9, pp.1264 - 1272
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Volume
- 60
- Number
- 9
- Start Page
- 1264
- End Page
- 1272
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/176308
- DOI
- 10.1057/jors.2008.95
- ISSN
- 0160-5682
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 산업공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/176308)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.