Issue No. 04 - April (1984 vol. 33)
A.K. Agrawala , Department of Computer Science, University of Maryland
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
E. J. Coffman, S. Tripathi, A. Agrawala and M. Garey, "A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors," in IEEE Transactions on Computers, vol. 33, no. , pp. 351-356, 1984.