IEEE Transactions on Computers

Download PDF

Keywords

Uniform Processor Systems, Consider A Set Of Processors P 1, , Pm Differing Only In Speed, And A Set Of Jobs With Exponentially Distributed Execution Times The Rate Parameter For The Ith Processor Is Given By I, 1 I M, Where We Assume The Processors Are Ordered So That 1 2 M The Problem Is To Sequence The Jobs Nonpreemptively So As To Minimize Expected Total Flow Time Sum Of Finishing Times We Define A Threshold Ru, Mean Flow Time Minimization, Routing Problems, Stochastic Optimization, Stochastic Scheduling

Abstract

Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Related Articles