
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
April 1984 (vol. 33 no. 4)
pp. 351356
ASCII Text  x  
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. 351356, April, 1984.  
BibTex  x  
@article{ 10.1109/TC.1984.1676440, author = {A.K. Agrawala and E.G., Jr. Coffman and M.R. Garey and S.K. Tripathi}, title = {A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {4}, issn = {00189340}, year = {1984}, pages = {351356}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676440}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors IS  4 SN  00189340 SP351 EP356 EPD  351356 A1  A.K. Agrawala, A1  E.G., Jr. Coffman, A1  M.R. Garey, A1  S.K. Tripathi, PY  1984 KW  uniform processor systems KW  Consider a set of processors P1 KW  ... KW  Pm differing only in speed KW  and a set of jobs with exponentially distributed execution times. The rate parameter for the ith processor is given by ?i KW  1 =i = m KW  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 KW  Mean flow time minimization KW  routing problems KW  stochastic optimization KW  stochastic scheduling VL  33 JA  IEEE Transactions on Computers ER   
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. 351356, April 1984, doi:10.1109/TC.1984.1676440
Usage of this product signifies your acceptance of the Terms of Use.