Common due-date assignment and scheduling on parallel machines with sequence-dependent setup times
- Title
- Common due-date assignment and scheduling on parallel machines with sequence-dependent setup times
- Author
- 이동호
- Keywords
- Parallel Machines; Due-Date Assignment; Scheduling; Sequence-Dependent Setup Times; Heuristics
- Issue Date
- 2013-05
- Publisher
- The Korean Operations and Management Science Society
- Citation
- Management Science and Financial Engineering, 2013, 19(1), P.29-36
- Abstract
- This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.
- URI
- http://koreascience.or.kr/article/ArticleFullRecord.jsp?cn=E1MSAQ_2013_v19n1_29
- ISSN
- 1226-0797; 2287-2361; 2287-2043
- DOI
- 10.7737/MSFE.2013.19.1.029
- Appears in Collections:
- COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML