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:15Z | - |
dc.date.available | 2017-07-19T12:45:15Z | - |
dc.date.created | 2016-07-12 | - |
dc.date.issued | 2011-02 | - |
dc.identifier.issn | 1094-6136 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/36382 | - |
dc.description.abstract | We consider the problem of nonpreemptively scheduling a set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a prespecified set of machines on which it can be processed, called its eligible set. We consider the most general case of machine eligibility constraints as well as special cases of nested and inclusive eligible sets. Both online and offline models are considered. For offline problems we develop optimal algorithms that run in polynomial time, while for online problems we focus on the development of optimal algorithms of a new and more elaborate structure as well as approximation algorithms with good competitive ratios. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.relation.isPartOf | JOURNAL OF SCHEDULING | - |
dc.title | Scheduling Jobs with Equal Processing Times subject to Machine Eligibility Constraints | - |
dc.type | Article | - |
dc.identifier.doi | 10.1007/S10951-010-0190-0 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | JOURNAL OF SCHEDULING, v.14, no.1, pp.27 - 38 | - |
dc.identifier.wosid | 000289166500004 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 38 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 27 | - |
dc.citation.title | JOURNAL OF SCHEDULING | - |
dc.citation.volume | 14 | - |
dc.contributor.affiliatedAuthor | Lee, K | - |
dc.identifier.scopusid | 2-s2.0-79952625663 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 20 | - |
dc.description.scptc | 27 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article; Proceedings Paper | - |
dc.subject.keywordPlus | UNIT-LENGTH JOBS | - |
dc.subject.keywordPlus | PARALLEL MACHINES | - |
dc.subject.keywordPlus | APPROXIMATION | - |
dc.subject.keywordAuthor | Parallel machine scheduling | - |
dc.subject.keywordAuthor | Eligibility constraint | - |
dc.subject.keywordAuthor | Nested and inclusive eligible sets | - |
dc.subject.keywordAuthor | Equal-processing-time jobs | - |
dc.subject.keywordAuthor | Online and offline scheduling | - |
dc.subject.keywordAuthor | Makespan | - |
dc.subject.keywordAuthor | Competitive ratio | - |
dc.subject.keywordAuthor | Worst-case ratio | - |
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.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.