Abstract
We consider the problem of scheduling jobs on parallel machines to minimize flowtime, where all decisions about loading and sequencing must be made before any processing is done. We find policies that minimize flowtime stochastically or in the increasing convex sense under various assumptions.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献