DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hwang, HC | - |
dc.contributor.author | Chang, SY | - |
dc.date.accessioned | 2016-03-31T13:51:27Z | - |
dc.date.available | 2016-03-31T13:51:27Z | - |
dc.date.created | 2009-02-28 | - |
dc.date.issued | 1998-08 | - |
dc.identifier.issn | 0898-1221 | - |
dc.identifier.other | 1998-OAK-0000000314 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/20712 | - |
dc.description.abstract | We study the nonpreemptive parallel machines scheduling problem where some of the machines are planned to be shutdown. We apply LPT algorithm to the problem and analyze its performance. Our analysis shows that the makespan of the LPT schedule is bounded by twice the optimum makespan if no more than half of the machines are allowed to be shutdown simultaneously. We also show that this bound is tight by constructing a worst-case example. (C) 1998 Elsevier Science Ltd. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.relation.isPartOf | COMPUTERS & MATHEMATICS WITH APPLICATIONS | - |
dc.subject | parallel machines scheduling | - |
dc.subject | machine shutdowns | - |
dc.subject | longest processing time (LPT) | - |
dc.subject | algorithm | - |
dc.title | Parallel machines scheduling with machine shutdowns | - |
dc.type | Article | - |
dc.contributor.college | 산업경영공학과 | - |
dc.identifier.doi | 10.1016/S0898-1221(98)00126-6 | - |
dc.author.google | HWANG, HC | - |
dc.author.google | CHANG, SY | - |
dc.relation.volume | 36 | - |
dc.relation.issue | 3 | - |
dc.relation.startpage | 21 | - |
dc.relation.lastpage | 31 | - |
dc.contributor.id | 10109240 | - |
dc.relation.journal | COMPUTERS & MATHEMATICS WITH APPLICATIONS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | COMPUTERS & MATHEMATICS WITH APPLICATIONS, v.36, no.3, pp.21 - 31 | - |
dc.identifier.wosid | 000075007900003 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 31 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 21 | - |
dc.citation.title | COMPUTERS & MATHEMATICS WITH APPLICATIONS | - |
dc.citation.volume | 36 | - |
dc.contributor.affiliatedAuthor | Chang, SY | - |
dc.identifier.scopusid | 2-s2.0-0032136846 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 31 | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | parallel machines scheduling | - |
dc.subject.keywordAuthor | machine shutdowns | - |
dc.subject.keywordAuthor | longest processing time (LPT) | - |
dc.subject.keywordAuthor | algorithm | - |
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.