基于N-策略的多级适应性休假的M/G/1排队系统

N-策略的休假排队模型有着广泛的应用背景。在文献[2-3]的基础上,研究了N-策略多级适应性休假M/G/1排队系统。通过使用全概率分析方法、拉普拉斯变换和拉普拉斯-斯蒂阶变换理论,得到各阶段队长的瞬态分布、队长的母函数以及平均队长的递推表达式。为预测某时刻顾客数量的概率大小、获得利益最大化的阈值N提供了理论依据。     

M/G/1(RVT,P(j))排队系统的另一分析方法及其应用

M/G/1(RVT,P(j))表示服务员具有随机长度休息时间(RVT)的、且一休息时间结束时有 j 个顾客等待的概率为 P(j)的、修正的 M/G/1 排队系统。我们用嵌入 Markov 链的技术已详细地分析过这一排队系统,这里提供另一分析方法。最后,应用这个排队系统的分析结果,对时隙 ALOHA 卫星公用信道的分组碰撞概率计算公式作了推导。     

一种基于分组传送的话音/数据综合的排队模型

本文在话音和数据均为分组传送的基础上,提出并分析了一种话音数据综合的排队模型,从M/D/1排队系统出发,推导了本模型中话音和数据分组的平均迟延及平均队长的近似公式。计算机对公式进行数值分析得出的结果和用GPSS语言模拟本排队模型得出的结果是基本吻合的。     

基于SPN有限等待差错服务的火力单元排队模型

给出了一般排队模型的SPN描述,分析了防空火力单元的实际作战过程,在已有的火力单元的模型基础上,提出了有限等待差错服务的排队模型,详细分析了排队模型的运行机制,包括顾客有限等待、优先级的排队等,最后运用SPN理论对应的联系谓词公式和随机开关对模型进行了强有力的描述。是构建防空战役层面大型排队网络模型的基础。     

一个具有相互独立、不同分布服务时间序列的排队模型

讨论的排队模型 ,放宽了GI/G/1系统中“服务时间独立同分布”的限制 ,只要求各服务时间相互独立 ,因而较GI/G/1排队模型能更合理地拟合实际问题 .在此较宽的条件下 ,利用补充变量的方法 ,求得了该排队系统队长的瞬时分布     

随机环境中的M/MY/1排队系统

文献［４］讨论了随机环境中的Ｍ／Ｍ／１排队模型，本文提出和讨论随机环境中的Ｍ／Ｍｙ／１排队模型，在统计平衡条件下给出了队长和等待队长的平稳分布以及平均队长和平均等待队长，得到了等待时间和逗留时间分布以及平均等待时间和平均逗留时间。     

基于排队论的协同防空的作战效能分析

舰艇编队协同防空作战成为未来海战的重要形式,运用排队论对舰艇编队协同防空的作战效能进行了研究。以排队理论为基础建立了舰艇编队协同防空的排队模型,运用理论分析得到了以整个编队毁伤目标概率为指标的防空效能。通过对防空效能的计算与仿真,分析了几个重要参数对防空效能的影响,为多层舰艇防空系统的设计与运用提供了理论支持。     

基于排队论的协同防空作战效能分析

舰艇编队协同防空作战是未来海战的重要形式,运用排队论对舰艇编队协同防空的作战效能进行了研究。以排队理论为基础建立了舰艇编队协同防空的排队模型,运用理论分析得到了以整个编队毁伤目标概率为指标的防空效能。通过对防空效能的计算与仿真,分析了几个重要参数对防空效能的影响,为多层舰艇防空系统的设计与运用提供了理论支持。     

马尔可夫过程的k/N系统使用任务完成能力分析

研究了任务期间允许换件维修和备件供应时k/N系统的任务完成能力.首先,利用马尔可夫过程分析了k/N系统的状态转移过程,研究了k/N系统在特定维修保障策略下的运行过程.然后,以k/N系统固定任务时间内在正常状态停留时间的分布函数作为其任务完成概率模型,并通过全概率分解和更新过程的分析方法对任务完成概率进行求解.最后,利用任务完成概率模型在Matlab中绘制了任务完成概率随任务时间、任务量、备件携行数量以及备件平均供应时间的变化曲线,讨论并分析了对任务完成概率的影响.     

三维空间主/被动雷达抗多假目标干扰研究

针对多假目标欺骗干扰下异地配置的主/被动雷达传感器系统,提出了一种新的三维情况下主/被动雷达联合鉴别虚假目标算法.首先采用基准线最小距离法排除部分虚假目标,再利用三维分配算法进一步进行鉴别.该算法与基于角度统计量和距离统计量鉴别虚假目标算法相比,可以得到较高的正确鉴别概率和较低的误鉴别概率.最后通过仿真的方法分析了观测次数、虚假目标距离和被动雷达精度对算法鉴别虚假目标概率的影响,结果表明,该算法可使主/被动雷达系统有效鉴别假目标.     

Optimal admission pricing policies for M/Ek/1 queues

This paper extends the Low-Lippman M/M/1 model to the case of Gamma service times. Specifically, we have a queue in which arrivals are Poisson, service time is Gamma-distributed, and the arrival rate to the system is subject to setting an admission fee p. The arrival rate λ(p) is non-increasing in p. We prove that the optimal admission fee p^* is a non-decreasing function of the customer work load on the server. The proof is for an infinite capacity queue and holds for the infinite horizon continuous time Markov decision process. In the special case of exponential service time, we extend the Low-Lippman model to include a state-dependent service rate and service cost structure (for finite or infinite time horizon and queue capacity). Relatively recent dynamic programming techniques are employed throughout the paper. Due to the large class of functions represented by the Gamma family, the extension is of interest and utility.     

Waiting time distributions for transient bulk queues with general vehicle dispatching strategies

A numerical approach is presented for determining the waiting time distribution in a transient bulk-arrival, bulk-service queue. Vehicle departures from the queue are governed by a general dispatch strategy that includes holding with a variable release function and vehicle cancellations. The waiting time distribution of a customer (in a group) arriving at a given point in time is calculated by simulating the process in discrete time and determining at each step the probability the customer has left the system. The dispatch strategies require knowing the total length of the queue as well as the position a customer holds in the queue. An exact approach is compared to an accurate approximation which is 50 to 100 times faster. Comparisons are made with other approaches in the context of steady-state systems.     

A sequential scheduling problem with impatient jobs

There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λ_i before departing the system. The service time of customer i has distribution F_i, and on completion of service of customer i a positive reward r_i is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015     

Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management

In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward.     

Some properties of optimal control policies for entry to an M/M/1 queue

Customers served by an M/M/1 queueing system each receive a reward R but pay a holding cost of C per unit time (including service time) spent in the system. The decision of whether or not a customer joins the queue can be made on an individual basis or a social basis. The effect of increasing the arrival rate on the optimal policy parameters is examined. Some limiting results are also derived.     

A finite capacity GI/PH/1 queue with group services

We consider a finite-capacity single-server queue in which arrivals occur one at a time, according to a renewal process. The successive service times are mutually independent and have a common phase-type distribution. The customers are served in groups of size at least L, a preassigned threshold value. Explicit analytic expressions for the steady-state queue-length densities at arrivals and at arbitrary time points, and the throughput of the system are obtained. The Laplace-Stieltjes transform of the stationary waiting-time distribution of an admitted customer at points of arrivals is computed. It is shown to be of phase type when the arrival process is also of phase type. Efficient algorithmic procedures for the steady-state analysis of the model are presented. These procedures are used in arriving at an optimal value for L that minimizes the mean waiting time of an admitted customer. A conjecture on the nature of the mean waiting time is proposed.     

On the busy period of the M/G/1 retrial queue

The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 115–127, 2000     

Customer delays in M/M/c repair systems with spares

A service center to which customers bring failed items for repair is considered. The items are exchangeable in the sense that a customer is ready to take in return for the failed item he brought to the center any good item of the same kind. This exchangeability feature makes it possible for the service center to possess spares. The focus of the article is on customer delay in the system—the time that elapses since the arrival of a customer with a failed item and his departure with a good one—when repaired items are given to waiting customers on a FIFO basis. An algorithm is developed for the computation of the delay distribution when the item repair system operates as an M/M/c queue.     

An M/M/1 queue with delayed feedback

We present some results for M/M/1 queues with finite capacities with delayed feedback. The delay in the feedback to an M/M/1 queue is modelled as another M-server queue with a finite capacity. The steady state probabilities for the two dimensional Markov process {N(t), M(t)} are solved when N(t) = queue length at server 1 at t and M(t) = queue length at server 2 at t. It is shown that a matrix operation can be performed to obtain the steady state probabilities. The eigenvalues of the operator and its eigenvectors are found. The problem is solved by fitting boundary conditions to the general solution and by normalizing. A sample problem is run to show that the solution methods can be programmed and meaningful results obtained numerically.     

On a single-server queue with state-dependent service

This paper discusses a class of queueing models in which the service time of a customer al a single server facility is dependent on the queue size at the onset of its service. The Laplace transform for the wait in queue distribution is derived and the utilization of the server is given when the arrival is a homogeneous Poisson process.