具有p-进入规则和Min(N,D,V)-策略的M/G/1排队系统容量的优化设计及最优控制策略

System Capacity Optimization Design and Optimal Control Policy(N*,D*) for M/G/1 Queue with p-Entering Discipline and Min(N,D,V)-Policy

该文研究具有p-进入规则和系统采取Min(N,D,V)-策略的M/G/1排队系统,其中在服务员多重休假期间到达的顾客以概率p(0<p≤1)进入系统.运用全概率分解技术和拉普拉斯变换工具讨论了系统从任意初始状态出发,在任意时刻t的瞬态队长分布,得到瞬态队长分布的拉普拉斯变换的表达式,进一步得到稳态队长分布的递推表达式.同时,结合稳态队长分布,通过数值计算实例讨论了系统容量的优化设计问题.最后,在建立系统费用结构模型的基础上,导出了系统长期单位时间内的期望费用的显示表达式,并通过数值实例确定了使得系统在长期单位时间内的期望费用最小的联合最优控制策略(N^*,D^*).

This paper considers a M/G/1 queueing system with p-entering discipline and Min(N,D,V)-policy,in which the customers who arrive during multiple vacations enter the system with probability p(0<p≤1). By using the total probability decomposition technique and the Laplace transform, we discuss the transient distribution of queue length at any time t which started from an arbitrary initial state, and obtain the expressions of the Laplace transform of transient queue-length distribution. Moreover, we obtain the recursion expressions of the steady-state queue length distribution. Meanwhile, we discuss the optimal capacity design by combining the steady-state queue length distribution and numerical example. Finally, the explicit expression of the long-run expected cost rate is derived under a given cost structure. And by through numerical calculation, we determine the optimal control policy (N^*,D^*) for minimizing the long-run expected cost per unit time.