首页> 外文期刊>Mathematical methods of operations research >Admission control of a service station when the arrivals are internal
【24h】

Admission control of a service station when the arrivals are internal

机译:内部到达时服务站的入场控制

获取原文
获取原文并翻译 | 示例
           

摘要

All studies in the admission control of a service station make decisions at arrival epochs. When arrivals are internal and are rejected from a queue, the rejected jobs have to be routed to other stations in the system. However the system will not know whether a job will be admitted to a queue or not until its arrival epoch to that queue. Thus, the system has to react dynamically and agilely to the decisions made at a specific queue and may try several queues before finding a queue that admits the job. This paper remedies these difficulties by changing the decision epochs of the admission control from arrival epochs to departure epochs with the actions of switching (keeping) the arrival stream on or off. Thus upstream stations will have information on the admission status of their downstream stations all the time. It is proved that the optimal policy for this revised admission control system is of control limit type for an M/G/1 queue. Comparisons of the optimal values and optimal policies for the admission controls made at arrival epochs and at departure epochs are included in the paper.
机译:服务站准入控制中的所有研究都在到达时机做出决策。当到达内部并且从队列中拒绝时,必须将拒绝的作业路由到系统中的其他工作站。但是,系统直到作业到达该队列的时期才知道该作业是否被允许进入队列。因此,系统必须对在特定队列中做出的决定做出动态而敏捷的反应,并可能在找到允许作业的队列之前尝试多个队列。本文通过将进入流切换(保持)为开或关的动作,将准入控制的决策时期从到达时期更改为出发时期来解决这些困难。因此,上游站将始终具有有关其下游站的准入状态的信息。事实证明,此修改后的准入控制系统的最佳策略是M / G / 1队列的控制限制类型。本文包括在到达时期和离开时期做出的准入控制的最优值和最优策略的比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号