Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이동호 | - |
dc.date.accessioned | 2018-03-13T02:54:28Z | - |
dc.date.available | 2018-03-13T02:54:28Z | - |
dc.date.issued | 2013-05 | - |
dc.identifier.citation | Management Science and Financial Engineering, 2013, 19(1), P.29-36 | en_US |
dc.identifier.issn | 1226-0797 | - |
dc.identifier.issn | 2287-2361 | - |
dc.identifier.issn | 2287-2043 | - |
dc.identifier.uri | http://koreascience.or.kr/article/ArticleFullRecord.jsp?cn=E1MSAQ_2013_v19n1_29 | - |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | The Korean Operations and Management Science Society | en_US |
dc.subject | Parallel Machines | en_US |
dc.subject | Due-Date Assignment | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Sequence-Dependent Setup Times | en_US |
dc.subject | Heuristics | en_US |
dc.title | Common due-date assignment and scheduling on parallel machines with sequence-dependent setup times | en_US |
dc.type | Article | en_US |
dc.relation.no | 1 | - |
dc.relation.volume | 19 | - |
dc.identifier.doi | 10.7737/MSFE.2013.19.1.029 | - |
dc.relation.page | 29-36 | - |
dc.relation.journal | MSFE(Management Science & Financial Engineering) | - |
dc.contributor.googleauthor | Kim, Jun-Gyu | - |
dc.contributor.googleauthor | Yu, Jae-Min | - |
dc.contributor.googleauthor | Lee, Dong-Ho | - |
dc.relation.code | 2012285546 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF INDUSTRIAL ENGINEERING | - |
dc.identifier.pid | leman | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.