Open Access System for Information Sharing

Login Library

 

Article
Cited 33 time in webofscience Cited 30 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorHwang, HC-
dc.contributor.authorChang, SY-
dc.date.accessioned2016-03-31T13:51:27Z-
dc.date.available2016-03-31T13:51:27Z-
dc.date.created2009-02-28-
dc.date.issued1998-08-
dc.identifier.issn0898-1221-
dc.identifier.other1998-OAK-0000000314-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/20712-
dc.description.abstractWe 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.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.relation.isPartOfCOMPUTERS & MATHEMATICS WITH APPLICATIONS-
dc.subjectparallel machines scheduling-
dc.subjectmachine shutdowns-
dc.subjectlongest processing time (LPT)-
dc.subjectalgorithm-
dc.titleParallel machines scheduling with machine shutdowns-
dc.typeArticle-
dc.contributor.college산업경영공학과-
dc.identifier.doi10.1016/S0898-1221(98)00126-6-
dc.author.googleHWANG, HC-
dc.author.googleCHANG, SY-
dc.relation.volume36-
dc.relation.issue3-
dc.relation.startpage21-
dc.relation.lastpage31-
dc.contributor.id10109240-
dc.relation.journalCOMPUTERS & MATHEMATICS WITH APPLICATIONS-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCI-
dc.collections.nameJournal Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationCOMPUTERS & MATHEMATICS WITH APPLICATIONS, v.36, no.3, pp.21 - 31-
dc.identifier.wosid000075007900003-
dc.date.tcdate2019-01-01-
dc.citation.endPage31-
dc.citation.number3-
dc.citation.startPage21-
dc.citation.titleCOMPUTERS & MATHEMATICS WITH APPLICATIONS-
dc.citation.volume36-
dc.contributor.affiliatedAuthorChang, SY-
dc.identifier.scopusid2-s2.0-0032136846-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc31-
dc.type.docTypeArticle-
dc.subject.keywordAuthorparallel machines scheduling-
dc.subject.keywordAuthormachine shutdowns-
dc.subject.keywordAuthorlongest processing time (LPT)-
dc.subject.keywordAuthoralgorithm-
dc.relation.journalWebOfScienceCategoryMathematics, Applied-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaMathematics-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

장수영CHANG, SOO YOUNG
Dept. of Industrial & Management Eng.
Read more

Views & Downloads

Browse