Scheduling with Random Service Times
Scheduling with Random Service Times
复制标题
DOI：
10.1287/mnsc.12.9.707
复制
发表时间：
1966-05
影响因子：
5.4
通讯作者：
M. Rothkopf
中科院分区：
文献类型：
--
作者：
M. Rothkopf
本文考虑具有随机变量服务时间的\(m\)个立即可用任务的调度问题。结果表明，某些此类问题可简化为等效的确定性问题。对于一些问题，证明了存在不涉及将未完全处理的任务从服务中移除的最优调度；而对于其他问题，则给出了反证。
This paper considers the problem scheduling of m immediately available tasks with random variable service times. It is shown that certain such problems can be reduced to equivalent deterministic problems. The existence of optimal schedules not involving the removal from service of incompletely processed tasks for some problems is proved and for other problems is disproved.