Abstract
Under certain conditions it is shown that for jobs with increasing completion rates the expected flow time is minimised by a non-pre-emptive service discipline.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Derivative‐Free Stochastic Search;Reinforcement Learning and Stochastic Optimization;2022-04-02
2. Scheduling;2012
3. Bibliography;Wiley Series in Probability and Statistics;2011-09-26
4. References;Multi-Armed Bandit Allocation Indices;2011-02-16
5. Stochastic scheduling on parallel machines to minimize discounted holding costs;Journal of Scheduling;2009-02-24