This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
April 1984 (vol. 33 no. 4)
pp. 351-356
A.K. Agrawala, Department of Computer Science, University of Maryland
Index Terms:
uniform processor systems, Consider a set of processors P1,..., 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
Citation:
A.K. Agrawala, E.G., Jr. Coffman, M.R. Garey, S.K. Tripathi, "A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors," IEEE Transactions on Computers, vol. 33, no. 4, pp. 351-356, April 1984, doi:10.1109/TC.1984.1676440
Usage of this product signifies your acceptance of the Terms of Use.