On Minimizing Flow Time on Processors with Variable Unit Processing Time

H. C. Huang
Additional contact information
H. C. Huang: National University of Singapore, Kent Ridge, Singapore

Operations Research, 1986, vol. 34, issue 5, 801-802

Abstract: This paper uses the interchange technique to prove a result of Meilijson and Tamir that the shortest processing time (SPT) schedule minimizes total flow time on parallel identical processors that have unequal starting times and nonincreasing unit processing time. The SPT schedule remains optimal for a special case when the unit processing time is increasing.

Keywords: 581; processors; with; variable; processing; rate (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.5.801 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:34:y:1986:i:5:p:801-802

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().