DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hwang, HC | - |
dc.contributor.author | Lee, K | - |
dc.contributor.author | Chang, SY | - |
dc.date.accessioned | 2016-04-01T02:12:23Z | - |
dc.date.available | 2016-04-01T02:12:23Z | - |
dc.date.created | 2009-02-28 | - |
dc.date.issued | 2005-04-30 | - |
dc.identifier.issn | 0166-218X | - |
dc.identifier.other | 2005-OAK-0000005030 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/24653 | - |
dc.description.abstract | We consider the makespan minimization parallel machine scheduling problem where each machine may be unavailable for a known time interval. For this problem, we investigate how the worst-case behavior of the longest processing time first algorithm (LPT) is affected by the availability of machines. In particular, for given m machines, we analyze the cases where arbitrary number, lambda, ranging from one to in - 1, machines are unavailable simultaneously. Then, we show that the makespan of the schedule generated by LPT is never more than the tight worst-case bound of 1 + 1/2 [m/(m -lambda)] times the optimum makespan. (c) 2004 Elsevier B.V. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.relation.isPartOf | DISCRETE APPLIED MATHEMATICS | - |
dc.subject | parallel machines scheduling | - |
dc.subject | availability | - |
dc.subject | shutdowns | - |
dc.subject | longest processing time (LPT) | - |
dc.subject | PARALLEL MACHINES | - |
dc.subject | ALGORITHMS | - |
dc.subject | TIME | - |
dc.title | The effect of machine availability on the worst-case performance of LPT | - |
dc.type | Article | - |
dc.contributor.college | 산업경영공학과 | - |
dc.identifier.doi | 10.1016/j.dam.2004.12.002 | - |
dc.author.google | Hwang, HC | - |
dc.author.google | Lee, K | - |
dc.author.google | Chang, SY | - |
dc.relation.volume | 148 | - |
dc.relation.issue | 1 | - |
dc.relation.startpage | 49 | - |
dc.relation.lastpage | 61 | - |
dc.contributor.id | 10109240 | - |
dc.relation.journal | DISCRETE APPLIED MATHEMATICS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | DISCRETE APPLIED MATHEMATICS, v.148, no.1, pp.49 - 61 | - |
dc.identifier.wosid | 000228376700004 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 61 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 49 | - |
dc.citation.title | DISCRETE APPLIED MATHEMATICS | - |
dc.citation.volume | 148 | - |
dc.contributor.affiliatedAuthor | Lee, K | - |
dc.contributor.affiliatedAuthor | Chang, SY | - |
dc.identifier.scopusid | 2-s2.0-15344342575 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 29 | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | parallel machines scheduling | - |
dc.subject.keywordAuthor | availability | - |
dc.subject.keywordAuthor | shutdowns | - |
dc.subject.keywordAuthor | longest processing time (LPT) | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
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.