On Minimizing Flow Time on Processors with Variable Unit Processing Time
Operations Research · 1986 · Volume 34 · Issue 5
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
Enable JavaScript for citation tools and additional paper interactions.