Approximations for Networks of Queues with Overtime
针对部分站点存在加班操作的排队网络，提出了简单近似方法，给出了单机和多机站点的性能界限，计算表明该方法与参数分解结合时表现良好，适用于制造系统分析。
This paper presents simple approximations for networks of queues with overtime operation at some stations. This type of network is commonly encountered in several manufacturing applications. We provide bounds on the performance of the approximations for single and multiple machine stations. Our results suggest that the methods perform satisfactorily. These approximations can be used in conjunction with parametric decomposition methods to analyze queueing networks. The computational results indicate that the performance of the decomposition approach does not deteriorate when combined with the methods proposed in this paper.