Stochastic dispatching of multi-priority jobs to heterogeneous processors
暂无分享,去创建一个
[1] R. Weber. Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime , 1982, Journal of Applied Probability.
[2] Michael Pinedo,et al. Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions , 1980, Journal of Applied Probability.
[3] J. Walrand,et al. Individually optimal routing in parallel systems , 1985 .
[4] Pitu B. Mirchandani,et al. Optimal dispatching of multipriority jobs to two heterogeneous workstations , 1989 .
[5] M. Garey,et al. Minimizing expected makespans on uniform processor systems , 1987, Advances in Applied Probability.
[6] J. Walrand,et al. Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime , 1986, Journal of Applied Probability.
[7] Satish K. Tripathi,et al. A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors , 1984, IEEE Transactions on Computers.
[8] Richard Weber. Scheduling Stochastic Jobs on Parallel Machines to Minimize Makespan or Flowtime , 1982 .