Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Minimizing the total stretch in two parallel machines with GOS levels
- Issue Date
- Jan-2016
- Publisher
- ICIC Express Letters Office
- Keywords
- Grade of service; Non-preemptive scheduling; Parallel machines; Total stretch
- Citation
- ICIC Express Letters, Part B: Applications, v.7, no.1, pp.181 - 187
- Journal Title
- ICIC Express Letters, Part B: Applications
- Volume
- 7
- Number
- 1
- Start Page
- 181
- End Page
- 187
- ISSN
- 2185-2766
- Abstract
- We consider a non-preemptive scheduling problem to minimize the total stretch in two parallel machines with two grade of service (GoS) levels. 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 show that the problem can be solved in polynomial time. © 2016 ICIC Express Letters Office.
- 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.