Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Single and parallel machine scheduling to minimize the total stretch
- Authors
- Lee, J.R.; Yoon, S.-H.
- Issue Date
- Apr-2017
- Publisher
- ICIC Express Letters Office
- Keywords
- Non-preemptive scheduling; Parallel machines; Polynomial time algorithm; Total stretch
- Citation
- ICIC Express Letters, v.11, no.4, pp.893 - 898
- Journal Title
- ICIC Express Letters
- Volume
- 11
- Number
- 4
- Start Page
- 893
- End Page
- 898
- ISSN
- 1881-803X
- 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.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.