Open Access System for Information Sharing

Login Library

 

Article
Cited 8 time in webofscience Cited 10 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorLee, K-
dc.contributor.authorHwang, HC-
dc.contributor.authorLim, K-
dc.date.accessioned2017-07-19T12:44:57Z-
dc.date.available2017-07-19T12:44:57Z-
dc.date.created2016-07-12-
dc.date.issued2014-07-
dc.identifier.issn0925-5273-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/36370-
dc.description.abstractWe 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.languageEnglish-
dc.publisherELSEVIER SCIENCE BV-
dc.relation.isPartOfINTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS-
dc.titleSemi-online Scheduling with GoS Eligibility Constraints-
dc.typeArticle-
dc.identifier.doi10.1016/J.IJPE.2014.03.001-
dc.type.rimsART-
dc.identifier.bibliographicCitationINTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, v.153, pp.204 - 214-
dc.identifier.wosid000337007900017-
dc.date.tcdate2019-02-01-
dc.citation.endPage214-
dc.citation.startPage204-
dc.citation.titleINTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS-
dc.citation.volume153-
dc.contributor.affiliatedAuthorLee, K-
dc.identifier.scopusid2-s2.0-84900502022-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc4-
dc.description.scptc4*
dc.date.scptcdate2018-05-121*
dc.description.isOpenAccessN-
dc.type.docTypeArticle-
dc.subject.keywordPlusPROCESSING SET RESTRICTIONS-
dc.subject.keywordPlus2 IDENTICAL MACHINES-
dc.subject.keywordPlusSERVICE PROVISION-
dc.subject.keywordPlusPARALLEL MACHINES-
dc.subject.keywordPlusGRADE-
dc.subject.keywordPlusALGORITHMS-
dc.subject.keywordAuthorSemi-online scheduling-
dc.subject.keywordAuthorGrade of Service (GoS)-
dc.subject.keywordAuthorUnified algorithm-
dc.subject.keywordAuthorCompetitive ratio-
dc.subject.keywordAuthorLower bound example-
dc.relation.journalWebOfScienceCategoryEngineering, Industrial-
dc.relation.journalWebOfScienceCategoryEngineering, Manufacturing-
dc.relation.journalWebOfScienceCategoryOperations Research & Management Science-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaEngineering-
dc.relation.journalResearchAreaOperations Research & Management Science-

qr_code

  • mendeley

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

Related Researcher

Views & Downloads

Browse