Single and parallel machine scheduling to minimize the total stretch
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, J.R. | - |
dc.contributor.author | Yoon, S.-H. | - |
dc.date.available | 2018-05-09T01:50:31Z | - |
dc.date.created | 2018-04-17 | - |
dc.date.issued | 2017-04 | - |
dc.identifier.issn | 1881-803X | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/7312 | - |
dc.description.abstract | We consider scheduling problems in a single machine and parallel machines to minimize the total stretch. The stretch of a job is defined as the ratio of the flow time to its processing time. When jobs have different release times, the problem of minimizing the total stretch is NP-complete even for a single machine. In this paper, we assume that the release times of jobs are all zeros. We provide some optimality conditions and propose a polynomial time algorithm for the problems. © 2017 ICIC International. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ICIC Express Letters Office | - |
dc.relation.isPartOf | ICIC Express Letters | - |
dc.title | Single and parallel machine scheduling to minimize the total stretch | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | ICIC Express Letters, v.11, no.4, pp.893 - 898 | - |
dc.description.journalClass | 1 | - |
dc.identifier.scopusid | 2-s2.0-85017117918 | - |
dc.citation.endPage | 898 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 893 | - |
dc.citation.title | ICIC Express Letters | - |
dc.citation.volume | 11 | - |
dc.contributor.affiliatedAuthor | Yoon, S.-H. | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.subject.keywordAuthor | Non-preemptive scheduling | - |
dc.subject.keywordAuthor | Parallel machines | - |
dc.subject.keywordAuthor | Polynomial time algorithm | - |
dc.subject.keywordAuthor | Total stretch | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.