Optimal stochastic scheduling of forest networks with switching penalties
Optimal stochastic scheduling of forest networks with switching penalties
复制标题
具有切换惩罚的森林网络最优随机调度
DOI：
--
复制
发表时间：
1994
影响因子：
1.2
通讯作者：
D. Teneketzis
中科院分区：
文献类型：
--
作者：
M. P. Van Oyen;D. Teneketzis
我们给出了在有N个队列（没有到达队列）的森林网络中调度单个服务器的最优策略的结构性质。除了线性保持成本外，我们还施加了一次性切换成本或批量设置延迟，这些延迟是在服务器处理与前一个队列不同的队列中的作业时产生的。我们使用奖励率概念来揭示穷举策略最优的持有成本和服务分布条件。对于两个节点概率串联连接的情况，我们明确定义了在类似条件下的最优策略。
We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch set-up delays which are incurred at each instant the server processes a job in a queue different from the previous one. We use reward rate notions to unearth conditions on the holding costs and service distributions for which an exhaustive policy is optimal. For the case of two nodes connected probabilistically in tandem, we explicitly define an optimal policy under similar conditions.