مرکز منطقه ای اطلاع رساني علوم و فناوري - A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors

Keywords :

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; uniform processor systems; Computer science; Delay effects; Finishing; Processor scheduling; Random variables; Routing; Stochastic processes; Stochastic 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; uniform processor systems;