Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Drobouchevitch, Inna G. | - |
dc.contributor.author | Sidney, Jeffrey B. | - |
dc.date.accessioned | 2021-09-06T16:08:42Z | - |
dc.date.available | 2021-09-06T16:08:42Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2012-09 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/107597 | - |
dc.description.abstract | We consider a problem of scheduling n identical nonpreemptive jobs with a common due date on in uniform parallel machines. The objective is to determine an optimal value of the due date and an optimal allocation of jobs onto machines so as to minimize a total cost function, which is the function of earliness, tardiness and due date values. For the problem under study, we establish a set of properties of an optimal solution and suggest a two-phase algorithm to tackle the problem. First, we limit the number of due dates one needs to consider in pursuit of optimality. Next, we provide a polynomial-time algorithm to build an optimal schedule for a fixed due date. The key result is an O(m(2) log m) algorithm that solves the main problem to optimality. Scope and purpose: To extend the existing research on cost minimization with earliness, tardiness and due date penalties to the case of uniform parallel machines. (C) 2011 Elsevier Ltd. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | SCHEDULING PROBLEMS | - |
dc.subject | COMMON | - |
dc.subject | ASSIGNMENT | - |
dc.subject | DEVIATION | - |
dc.subject | ART | - |
dc.title | Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Drobouchevitch, Inna G. | - |
dc.identifier.doi | 10.1016/j.cor.2011.05.012 | - |
dc.identifier.scopusid | 2-s2.0-84855528940 | - |
dc.identifier.wosid | 000301216600001 | - |
dc.identifier.bibliographicCitation | COMPUTERS & OPERATIONS RESEARCH, v.39, no.9, pp.1919 - 1926 | - |
dc.relation.isPartOf | COMPUTERS & OPERATIONS RESEARCH | - |
dc.citation.title | COMPUTERS & OPERATIONS RESEARCH | - |
dc.citation.volume | 39 | - |
dc.citation.number | 9 | - |
dc.citation.startPage | 1919 | - |
dc.citation.endPage | 1926 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | SCHEDULING PROBLEMS | - |
dc.subject.keywordPlus | COMMON | - |
dc.subject.keywordPlus | ASSIGNMENT | - |
dc.subject.keywordPlus | DEVIATION | - |
dc.subject.keywordPlus | ART | - |
dc.subject.keywordAuthor | Parallel machine scheduling | - |
dc.subject.keywordAuthor | Common due date | - |
dc.subject.keywordAuthor | Earliness | - |
dc.subject.keywordAuthor | Tardiness | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea 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.