DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, K | - |
dc.contributor.author | Hwang, HC | - |
dc.contributor.author | Lim, K | - |
dc.date.accessioned | 2017-07-19T12:44:57Z | - |
dc.date.available | 2017-07-19T12:44:57Z | - |
dc.date.created | 2016-07-12 | - |
dc.date.issued | 2014-07 | - |
dc.identifier.issn | 0925-5273 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/36370 | - |
dc.description.abstract | We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with different prior information: (1) the known total processing time, (2) the known largest processing time, (3) the known both total and largest processing times and (4) the known optimal makespan. For semi-online problems with different numbers of machines and information, we present a unified algorithm. Then we provide lower bounds of the competitive ratio for any algorithm and prove the competitive ratio of the proposed algorithm. (C) 2014 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | - |
dc.title | Semi-online Scheduling with GoS Eligibility Constraints | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/J.IJPE.2014.03.001 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, v.153, pp.204 - 214 | - |
dc.identifier.wosid | 000337007900017 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 214 | - |
dc.citation.startPage | 204 | - |
dc.citation.title | INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | - |
dc.citation.volume | 153 | - |
dc.contributor.affiliatedAuthor | Lee, K | - |
dc.identifier.scopusid | 2-s2.0-84900502022 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 4 | - |
dc.description.scptc | 4 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.description.isOpenAccess | N | - |
dc.type.docType | Article | - |
dc.subject.keywordPlus | PROCESSING SET RESTRICTIONS | - |
dc.subject.keywordPlus | 2 IDENTICAL MACHINES | - |
dc.subject.keywordPlus | SERVICE PROVISION | - |
dc.subject.keywordPlus | PARALLEL MACHINES | - |
dc.subject.keywordPlus | GRADE | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordAuthor | Semi-online scheduling | - |
dc.subject.keywordAuthor | Grade of Service (GoS) | - |
dc.subject.keywordAuthor | Unified algorithm | - |
dc.subject.keywordAuthor | Competitive ratio | - |
dc.subject.keywordAuthor | Lower bound example | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.