Article
Cited 12 time in 
Cited 14 time in 
Cited 14 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, K | - |
| dc.contributor.author | Lim, K | - |
| dc.date.accessioned | 2017-07-19T12:45:00Z | - |
| dc.date.available | 2017-07-19T12:45:00Z | - |
| dc.date.created | 2016-07-12 | - |
| dc.date.issued | 2013-10 | - |
| dc.identifier.issn | 1094-6136 | - |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/36372 | - |
| dc.description.abstract | We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a priori information: the total processing time, the largest processing time, the combination of the previous two or the optimal makespan. We propose a new algorithm that can be applied to the problem with the known total or largest processing time and prove that it has improved competitive ratios for the cases with a small number of machines. Improved lower bounds of the competitive ratio are also provided by presenting adversary lower bound examples. | - |
| dc.language | English | - |
| dc.publisher | SPRINGER | - |
| dc.relation.isPartOf | JOURNAL OF SCHEDULING | - |
| dc.title | Semi-online Scheduling Problems on a Small Number of Machines | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1007/S10951-013-0329-X | - |
| dc.type.rims | ART | - |
| dc.identifier.bibliographicCitation | JOURNAL OF SCHEDULING, v.16, no.5, pp.461 - 477 | - |
| dc.identifier.wosid | 000324108500002 | - |
| dc.date.tcdate | 2019-02-01 | - |
| dc.citation.endPage | 477 | - |
| dc.citation.number | 5 | - |
| dc.citation.startPage | 461 | - |
| dc.citation.title | JOURNAL OF SCHEDULING | - |
| dc.citation.volume | 16 | - |
| dc.contributor.affiliatedAuthor | Lee, K | - |
| dc.identifier.scopusid | 2-s2.0-84884354589 | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalClass | 1 | - |
| dc.description.wostc | 5 | - |
| dc.description.scptc | 3 | * |
| dc.date.scptcdate | 2018-05-121 | * |
| dc.type.docType | Article | - |
| dc.subject.keywordPlus | 2 IDENTICAL MACHINES | - |
| dc.subject.keywordPlus | BOUNDS | - |
| dc.subject.keywordPlus | ALGORITHMS | - |
| dc.subject.keywordPlus | TASKS | - |
| dc.subject.keywordPlus | SUM | - |
| dc.subject.keywordAuthor | Semi-online scheduling | - |
| dc.subject.keywordAuthor | Competitive ratio | - |
| dc.subject.keywordAuthor | Lower bound example | - |
| 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.