输入率可变且有差错服务的M/M/1排队系统的研究与应用

在到达系统的顾客数不变的情况下,顾客到达系统但是否进入系统接受服务对销售行业影响是巨大的.从排队长度对顾客输入率的影响着手,研究了顾客以泊松流到达系统,而到达系统的顾客进入系统接受服务的概率与队长有关的M/M/1排队模型,且系统服务会出差错.得出了进入系统的顾客流是泊松过程,且系统中的顾客数是生灭过程,并获得了该模型的平稳分布、顾客的平均输入率、系统的平均服务强度等多项指标,为销售行业调整自己的服务速度以影响排队长度及顾客输入率,进而提高自己的销售业绩提供了很有价值的参考.     

服务台可并行服务的排队系统研究

本文研究服务台可以同时并行服务多个顾客的排队系统.目前这一类新的排队问题在实践中经常出现,但却缺乏相应的理论模型,实际决策都是凭经验进行的.针对这一现状,本文首先构建相应的并行排队模型,使得服务台数量、可并行服务的最大顾客数量等重要决策变得科学化.进一步,针对并行排队模型比较复杂、求解比较困难的情况,构建相应的分散排队模型与集中排队模型,它们的求解简单方便,其结果可以有效的逼近原并行排队模型的最优解.     

对一类到达率可变的多重工作休假排队平稳状态的分析北大核心CSCD

讨论到达率依赖于当前系统中顾客数的M(n)/M/1多重工作休假排队.首先对排队模型用无限位相GI/M/1型Markov过程建模.其次通过用矩阵解析方法对所得过程求解,得到了排队系统平稳状态相关指标的结果.     

对一类到达率可变的多重工作休假排队平稳状态的分析

讨论到达率依赖于当前系统中顾客数的M(n)/M/1多重工作休假排队.首先对排队模型用无限位相GI/M/1型Markov过程建模.其次通过用矩阵解析方法对所得过程求解,得到了排队系统平稳状态相关指标的结果.     

机场航站楼安检通道数量配置优化方法研究

科学配置机场航站楼的安检通道数量,是提高安检服务效率、保障民航运输安全的重要手段.通过对机场航站楼的安检排队系统进行特征分析,利用排队理论建立两种安检排队模型.调研国内典型机场的实际运行数据,计算安检排队模型的主要运行指标,分析各指标的变化规律,并针对两种排队模型的运行效率进行对比.结果表明,排队系统的平均排队长和旅客平均等待时间均呈周期性变化,安检通道最少配置数量随着旅客到达率的增加而增加,单队多服务台系统在理论上比单队单服务台系统的运行效率更高.研究成果为优化机场航站楼安检通道数量配置、提高安检运行效率提供理论依据与决策支持.     

排队论在收费站设计与管理中的应用

为提高高速公路收费站的通行能力,针对收费站交通流的特性,用运筹理论优化了现有排队模型,给出了M/M/m系统中收费通道的最佳个数m的求法及每一个服务通道最佳服务率的计算方法.又基于交通流在平均到达率稳定而不可能恒定到达的情况,用排队理论分析建立了一种可变服务率的收费站排队模型,当队长超过规定值每增加h时,服务速度就提高μ.反之则降低μ,最后还对h的取值进行了最优化,使得模型更符合实际情况.     

汽车修理排队系统数据分析及配置优化

利用排队理论研究汽车修理系统,通过实例对输入过程和服务时间数据的整理进而验证了它们的分布规律,由此指出了应用排队模型类型,得到排队系统的各种基本运行参数,然后从顾客消费心理考虑,以区间估计的方法,在进入修理店时告知需要等待时间,最后给出汽车修理服务台的优化配置数.     

复杂网状排队系统的模拟研究

在详细分析网状排队系统特点的基础上,给出了该排队系统的模拟仿真算法,并通过模拟例子,研究了串联、最少人数选择和具有反馈的排队网络等不同情形下网状排队模型的队长、等待时间、停留时间、忙期等各种排队指标的统计特性.所得到的算法设计和统计分析具有灵活性和普遍性,为分析和评价网状排队服务系统提供了一个有力的工具.     

具有顾客止步、插队和中途退出行为的多服务台优先权排队系统

在实际排队系统中，顾客可能会出现各种不同的行为，本文主要研究了同时具有顾客止步、插队和中途退出三种行为的优先权排队系统。首先，本文基于顾客的止步、插队和中途退出行为构建了依赖系统状态的三段式输入率和服务率的多服务台排队模型，且采用收益-费用结构函数确定分段阈值。其次，本文研究具有顾客止步、插队和中途退出行为的普通排队系统和强占优先权排队系统。本文利用拟生灭过程对问题建模并使用矩阵分析法对模型进行求解，推导了两个排队系统的稳态概率的表达式并计算了相关的性能指标。通过数值分析，本文说明了顾客的止步、插队和中途退出三种行为对系统性能带来的影响是不容忽视的。     

多重休假的Bernoulli反馈M/G/1排队系统的稳态队长

系统地研究了多重休假的Bernoulli反馈排队模型,采用嵌入Markov链的方法,给出系统的一步转移概率矩阵进而求得稳态队长分布,并对排队顾客数进行随机分解,得到附加队长的母函数.     

A queuing approach for inventory planning with batch ordering in multi-echelon supply chains

This paper presents stylized models for conducting performance analysis of the manufacturing supply chain network (SCN) in a stochastic setting for batch ordering. We use queueing models to capture the behavior of SCN. The analysis is clubbed with an inventory optimization model, which can be used for designing inventory policies . In the first case, we model one manufacturer with one warehouse, which supplies to various retailers. We determine the optimal inventory level at the warehouse that minimizes total expected cost of carrying inventory, back order cost associated with serving orders in the backlog queue, and ordering cost. In the second model we impose service level constraint in terms of fill rate (probability an order is filled from stock at warehouse), assuming that customers do not balk from the system. We present several numerical examples to illustrate the model and to illustrate its various features. In the third case, we extend the model to a three-echelon inventory model which explicitly considers the logistics process.     

排队模型的研究进展

根据近10多年来的研究成果介绍以补充变量方法建立的排队模型的动态分析．首先介绍问题的来源,其次介绍研究排队模型的泛函分析工具,然后以D．R．Cox在1955年建立的M／C／1排队模型为例介绍排队模型的适定性,解的渐近行为及排队队长等数量指标的渐近性质的研究方法．最后提出需要进一步研究的一些问题．     

Exact tail asymptotics in a priority queue—characterizations of the preemptive model

In this paper, we consider the classical preemptive priority queueing system with two classes of independent Poisson customers and a single exponential server serving the two classes of customers at possibly different rates. For this system, we carry out a detailed analysis on exact tail asymptotics for the joint stationary distribution of the queue length of the two classes of customers, for the two marginal distributions and for the distribution of the total number of customers in the system, respectively. A complete characterization of the regions of system parameters for exact tail asymptotics is obtained through analysis of generating functions. This characterization has never before been completed. It is interesting to note that the exact tail asymptotics along the high-priority queue direction is of a new form that does not fall within the three types of exact tail asymptotics characterized by various methods for this type of two-dimensional system reported in the literature. We expect that the method employed in this paper can also be applied to the exact tail asymptotic analysis for the non-preemptive priority queueing model, among other possibilities.     

Order independent loss queues

This paper presents an analysis of generalized Order Independent (OI) loss queues serving customers belonging to different types (classes) where limits are placed on the number of customers of each type that may be present in the system. We prove that such queues satisfy partial balance and we present their stationary distribution. OI loss queues can be used to model blocking systems with simultaneous resource possession with the option of queueing blocked customers. The OI loss queue thus extends previous loss models where customers are rejected when processing resources are not available.This work was supported by grants from the Foundation for Research Development.     

Batch arrival queues with vacations and server setup

We study a single server queueing system whose arrival stream is compound Poisson and service times are generally distributed. Three types of idle period are considered: threshold, multiple vacations, and single vacation. For each model, we assume after the idle period, the server needs a random amount of setup time before serving. We obtain the steady-state distributions of system size and waiting time and expected values of the cycle for each model. We also show that the distributions of system size and waiting time of each model are decomposed into two parts, whose interpretations are provided. As for the threshold model, we propose a method to find the optimal value of threshold to minimize the total expected operating cost.     

A queueing network analysis of a health center

This paper shows how a queueing network model helped to uncover the causes of delay in a health center appointment clinic. Patients, clerks, technicians, doctors and nurses agreed that the clerical registration area was the major bottleneck in the system. Our first reaction was to simulate the system with special attention on the complex registration procedure. Time constraints on data collection and program development led us to a queueing network model and QNA, a software tool for analyzing queueing networks developed by Whitt. The queueing analysis showed the registration area was not the bottleneck and we conjectured that delays were due to scheduling problems. A preliminary trial in the clinic of a modified appointment system showed promise with a 20 minute reduction in average time in the system (based on a small sample). Although there were significant differences between features of the real system and assumptions in the queueing network model, the queueing network model yielded insight into the operation of the appointment clinic.     

可变输入率M/M/n模型的动态解及其渐近稳定性

本文运用有界线性算子半群理论讨论了可变输入率M/M/n排队模型,证明模型主算子生成C0半群,并运用一定的技巧证明动态解渐近稳定到其定态解.     

Performance analysis of discrete-time queue GI/G/1 with negative arrivals

In this paper, we consider a discrete-time GI/G/1 queueing model with negative arrivals. By deriving the probability generating function of actual service time of ordinary customers, we reduced the analysis to an equivalent discrete-time GI/G/1 queueing model without negative arrival, and obtained the probability generating function of buffer contents and random customer delay.     

Exponential two server queue withN-policy and general vacations

AnM/M/2 queueing system with vacations is studied in which two servers keep working until there are no customers, and then one of the two servers takes a vacation. The remaining server does not leave the system during the vacation, and keeps serving the arriving customers. The duration of vacation is general. We study both theN-policy multiple vacation model and the single vacation model. This paper is concerned with the determination of the stationary distribution of the number of customers in the systems, and their decomposition structures.     

Exact tail asymptotics in a priority queue—characterizations of the non-preemptive model

This is a companion paper to Li and Zhao (Queueing Syst. 63:355–381, 2009) recently published in Queueing Systems, in which the classical preemptive priority queueing system was considered. In the current paper we consider the classical non-preemptive priority queueing system with two classes of independent Poisson customers and a single exponential server serving the two classes of customers at possibly different rates. A complete characterization of the regions of system parameters for exact tail asymptotics is obtained through an analysis of generating functions. This is done for the joint stationary distribution of the queue length of the two classes of customers, for the two marginal distributions and also for the distribution of the total number of customers in the system, respectively. This complete characterization is supplemental to the existing literature, which would be useful to researchers.