DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, K | - |
dc.contributor.author | Leung, JYT | - |
dc.contributor.author | Pinedo, ML | - |
dc.date.accessioned | 2017-07-19T12:45:17Z | - |
dc.date.available | 2017-07-19T12:45:17Z | - |
dc.date.created | 2016-07-12 | - |
dc.date.issued | 2010-12 | - |
dc.identifier.issn | 1619-4500 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/36383 | - |
dc.description.abstract | In this paper we provide a survey of online scheduling in parallel machine environments with machine eligibility constraints and the makespan as objective function. We first give a brief overview of the different parallel machine environments and then survey the various types of machine eligibility constraints, including tree-hierarchical processing sets, Grade of Service processing sets, interval processing sets, and nested processing sets. We furthermore describe the relationships between the various different types of processing sets. We proceed with describing two basic online scheduling paradigms, namely online over list and online over time. For each one of the two paradigms we survey all the results that have been recorded in the literature with regard to each type of machine eligibility constraints. We obtain also several extensions in various directions. In the concluding section we describe the most important open problems in this particular area. | - |
dc.language | English | - |
dc.publisher | SPRINGER HEIDELBERG | - |
dc.relation.isPartOf | 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | - |
dc.subject | Parallel machine scheduling | - |
dc.subject | Eligibility constraint | - |
dc.subject | Tree-hierarchical and GoS processing sets | - |
dc.subject | Interval and nested processing sets | - |
dc.subject | Online and Semi-online scheduling | - |
dc.subject | Offline scheduling | - |
dc.subject | Makespan | - |
dc.subject | Competitive ratio | - |
dc.title | Makespan Minimization in Online Scheduling with Machine Eligibility | - |
dc.type | Article | - |
dc.identifier.doi | 10.1007/S10288-010-0149-1 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, v.8, no.4, pp.331 - 364 | - |
dc.identifier.wosid | 000285358400001 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 364 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 331 | - |
dc.citation.title | 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | - |
dc.citation.volume | 8 | - |
dc.contributor.affiliatedAuthor | Lee, K | - |
dc.identifier.scopusid | 2-s2.0-78650305581 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 19 | - |
dc.description.scptc | 19 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordPlus | PROCESSING SET RESTRICTIONS | - |
dc.subject.keywordPlus | PARALLEL MACHINES | - |
dc.subject.keywordPlus | SERVICE PROVISION | - |
dc.subject.keywordPlus | APPROXIMATION ALGORITHMS | - |
dc.subject.keywordPlus | IDENTICAL MACHINES | - |
dc.subject.keywordPlus | GRADE | - |
dc.subject.keywordPlus | COMPETITIVENESS | - |
dc.subject.keywordPlus | CONSTRAINTS | - |
dc.subject.keywordAuthor | Parallel machine scheduling | - |
dc.subject.keywordAuthor | Eligibility constraint | - |
dc.subject.keywordAuthor | Tree-hierarchical and GoS processing sets | - |
dc.subject.keywordAuthor | Interval and nested processing sets | - |
dc.subject.keywordAuthor | Online and Semi-online scheduling | - |
dc.subject.keywordAuthor | Offline scheduling | - |
dc.subject.keywordAuthor | Makespan | - |
dc.subject.keywordAuthor | Competitive ratio | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
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.