...
【24h】

Control policies of an M/G/1 queueing system with a removable and non-reliable server

机译:具有可移动和不可靠服务器的M / G / 1排队系统的控制策略

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

摘要

This paper considers a single non-reliable server in the ordinary M/G/1 queueing system whose arrivals form a Poisson process and service times are generally distributed. We also study a single removable and non-reliable server in the controllable M/G/1 queueing systems operating under the N policy, the T policy and the Min(N, T) policy. It is assumed that the server breaks down according to a Poisson process and the repair time has a general distribution. In three control policies, we show that the probability that the server is busy in the steady-state is equal to the traffic intensity. It is shown that the optimal N policy and the optimal Min(N, T) policy are always superior to the optimal T policy. Sensitivity analysis is also investigated.
机译:本文考虑了普通M / G / 1排队系统中的单个不可靠服务器,其到达过程由泊松过程组成,服务时间通常是分布的。我们还研究了在N策略,T策略和Min(N,T)策略下运行的可控M / G / 1排队系统中的单个可移动且不可靠的服务器。假定服务器根据Poisson进程发生故障,并且修复时间具有一般分布。在三种控制策略中,我们表明服务器在稳态下处于繁忙状态的概率等于流量强度。结果表明,最优N策略和最优Min(N,T)策略总是优于最优T策略。还对灵敏度分析进行了研究。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号