具有负顾客到达和RCH移除策略的GI/D-MSP/1/N离散时间排队系统

综合运用补充变量方法和基于条件概率矩阵迭代的嵌入Markov链方法研究了具有负顾客到达和RCH移除策略的离散时间GI/D-MSP/1/N排队系统. 获得了稳态情形下正顾客到达前夕, 任意时隙分点以及外部观测时刻的三种队长分布. 并进一步讨论了可入系统正顾客的等待时间分布. 最后通过几个特殊情形下的数值算例验证了计算方法理论分析的正确性.     

Service Mechanism and Pricing Based on Fairness Preference of Customers in Queuing System

Service providers often adopt the mechanism of customer classification due to the heterogeneity of customer waiting cost. However, the classification service may cause unfairness feeling of regular customers, then affect the revenue and social welfare. This paper provides the first exact analysis about the situation that service providers offer two classes of non-preemptive priority service when customer fairness perception is explicitly modeled. We model customer fairness perception as a negative utility on regular customers that's proportional to the waiting time difference between the two queues. By analyzing a stylized M/M/1 queue in monopoly service system, we can derive important results some of which reaffirm existed research results. First, from the perspective of revenue maximization, service providers should adopt the mechanism of customer classification and set up the two kinds of customers where they can see each other. Next, considering customer utility maximization,service providers should cancel the mechanism of customer classification, and keep one queue(regular customers) only. Then, from the perspective of social welfare maximization, service providers shouldalso adopt the mechanism of customer classification but set up the two kinds of customers where they cannot feel each other. Finally, this paper concludes the optimal pricing based on customer classification in the above three different perspectives. This research shows important reference value and practical significance for service providers who adopt the mechanism of classification service.     

Many-server queues with customer abandonment: A survey of diffusion and fluid approximations

The performance of a call center is sensitive to customer abandonment.In this survey paper,we focus on G/GI/ n + GI parallel-server queues that serve as a building block to model call center operations.Such a queue has a general arrival process(the G ),independent and identically distributed(iid) service times with a general distribution(the first GI),and iid patience times with a general distribution(the +GI).Following the square-root safety staffing rule,this queue can be operated in the quality- and efficiency-driven(QED) regime,which is characterized by large customer volume,the waiting times being a fraction of the service times,only a small fraction of customers abandoning the system,and high server utilization.Operational efficiency is the central target in a system whose staffing costs dominate other expenses.If a moderate fraction of customer abandonment is allowed,such a system should be operated in an overloaded regime known as the efficiency-driven (ED) regime.We survey recent results on the many-server queues that are operated in the QED and ED regimes.These results include the performance insensitivity to patience time distributions and diffusion and fluid approximate models as practical tools for performance analysis.     

Strong Approximation Method and the(Functional) Law of Iterated Logarithm for GI/G/1 Queue

In this paper, a unified method based on the strong approximation(SA) of renewal process(RP) is developed for the law of the iterated logarithm(LIL) and the functional LIL(FLIL), which quantify the magnitude of the asymptotic rate of the increasing variability around the mean value of the RP in numerical and functional forms respectively. For the GI/G/1 queue, the method provides a complete analysis for both the LIL and the FLIL limits for four performance functions: The queue length, workload, busy time and idle time processes, covering three regimes divided by the traffic intensity.     

N-策略与Min(N,V)-策略的M/G/1/∞排队系统等待时间的随机分解结构

在一些关于N-策略休假的M/G/1/∞排队模型研究中,由于顾客的等待时间与该顾客到达时刻以后的输入间隔时间不再独立,因此对顾客的稳态等待时间分布的讨论较为困难,更多是集中在系统的稳态队长和附加队长的讨论上,很少有文献讨论顾客的稳态等待时间及其随机分解.本文首先考虑经典N-策略休假的M/G/1/∞排队系统,讨论了顾客的稳态等待时间分布,给出了顾客的稳态等待时间的随机分解结果和顾客的附加延迟时间分布的显式表达式,同时,指出了已有结果的错误.其次,我们考虑在多重休假和单重休假下具有Min(N,V)-策略控制的M/G/1/∞排队系统,给出了顾客的稳态等待时间的随机分解结果,获得了顾客的平均稳态等待时间和平均附加延迟时间表达式.特别地,通过本文可直接获得一些特殊排队系统的相应结果.     

The bulk input M[X] /M/1 queue with working vacations

In this paper, we analyze a bulk input M^[X] /M/1 queue with multiple working vacations. A quasi upper triangle transition probability matrix of two-dimensional Markov chain in this model is obtained, and with the matrix analysis method, highly complicated probability generating function(PGF) of the stationary queue length is firstly derived, from which we got the stochastic decomposition result for the stationary queue length which indicates the evident relationship with that of the classical M^[X] /M/1 queue without vacation. It is important that we find the upper and the lower bounds of the stationary waiting time in the Laplace transform order using the properties of the conditional Erlang distribution. Furthermore, we gain the mean queue length and the upper and the lower bounds of the mean waiting time.     

THE M/M/c QUEUE WITH PH SYNCHRONOUS VACATIONS

1.IntroductionRecently,singleserverqueueswithvacationshavebeenstudiedextensivelyfromtheirowntheoreticalinterestaswellastheirapplicationstomanyengineeringsystemssuchascomputers,communicationnetworksandmanufacturingsystems.FOrtheM/G/lqueueingsystemswit...     

Randomized policy of a poisson input queue with <Emphasis Type="Italic">J</Emphasis> vacations

This paper studies the operating characteristics of an M/G/1 queuing system with a randomized control policy and at most J vacations.After all the customers are served in the queue exhaustively, the server immediately takes at most J vacations repeatedly until at least N customers are waiting for service in the queue upon returning from a vacation.If the number of arrivals does not reach N by the end of the J~(th) vacation,the server remains idle in the system until the number of arrivals in the queue re...     

基于多智能体的网购生鲜无人车配送调度仿真

无人车配送可有效缓解目前末端配送效率低、人力成本高、安全隐患多等问题。以城市社区网购生鲜无人车配送为研究对象，搭建了网购生鲜时空需求数据驱动的多智能体仿真平台，构建了基于实际路网的仿真环境及无人车、客户、配送站3类智能体，以运营成本最小及客户满意度最大为优化目标，设计并测试了动静态订单分配策略及距离最近或时间最紧配送路径规划策略。基于上海某生鲜电商实际订单数据，对不同策略展开情景模拟及敏感度分析，实现了运力资源的优化配置。     

THE M/M/c QUEUE WITH （e,d） SETUP TIME

The authors present a new queueing model with （e, d） setup time. Using the quasi-birth-and-death process and matrix-geometric method, the authors obtain the stationary distribution of queue length and the LST of waiting time of a customer in the system. Furthermore, the conditional stochastic decomposition results of queue length and waiting time are given.     

Optimal control of an M/G/1 retrial queue with vacations

In this note, we consider an M/G/1 retrial queue with server vacations, when retrial times, service times and vacation times are arbitrary distributed. The distribution of the number of customers in the system in stationary regime is obtained in terms of generating function. Next, we give heavy traffic approximation of such distribution. We show that the system size can be decomposed into two random variables, one of which corresponds to the system size of the ordinary M/G/1 FIFO queue without vacation. Such a stochastic decomposition property is useful for the computation of performance measures of interest. Finally, we solve simple problems of optimal control of vacation and retrial policies.     

The M/PH/1 queue with working vacations and vacation interruption

We study an M/PH/1 queue with phase type working vacation and vacation interruption where the vacation time follows a phase type distribution. The server serves the customers at a lower rate in a vacation period. The server comes back to the regular busy period at a service completion without completing the vacation. Such policy is called vacation interruption. In terms of quasi birth and death process and matrix-geometric solution method, we obtain the stationary queue length distribution. Moreover we obtain the conditional stochastic decomposition structures of queue length and waiting time when the service time distribution in the regular busy period is exponential.     

单重延误休假的M~x/G(M/G)/1可修排队系统分析(Ⅰ)—— 一些排队指标

考虑具有单重延误休假的MxG(MG)1可修排队系统,其中休假时间、服务时间、修理时间和延误休假时间都为任意分布(不一定是连续型),采用一种较简洁的方法,我们获得队长的瞬态解、平稳解和队长的随机分解表达式,同时给出了一些特殊情形下队长的随机分解结果     

A perishable inventory system with service facilities, <Emphasis Type="Italic">MAP</Emphasis> arrivals and <Emphasis Type="Italic">PH</Emphasis> — Service times

We consider a continuous review perishable （s,S） inventory system with a service facility consisting of a waiting hall of finite capacity and a single server. We assume two types of customers, ordinary and negative, arrive according to a Markovian Arrival Process （MAP）. An ordinary customer joins the queue and a negative customer instead of joining the queue removes one ordinary customer from the queue. The removal rule adopted in this paper is RCE （removal of a customer from the end）. The individual customer＇s unit demand is satisfied after a random time of service which is assumed to have a phase-type distribution. The life time of each item and the lead time of the reorders have been assumed to be independent exponential distributions. The joint probability distribution of the number of customers in the system and the inventory level is obtained for the steady state case. Various stationary system performance measures are computed and the total expected cost rate is calculated. The results are illustrated numerically.     

单重延误休假的$M^x$/G(M/G)/1可修排队系统分析(Ⅰ)—— 一些排队指标

考虑具有单重延误休假的$M^x$/G(M/G)/1可修排队系统,其中休假时间、服务时间、修理时间和延误休假时间都为任意分布(不一定是连续型),采用一种较简洁的方法,我们获得队长的瞬态解、平稳解和队长的随机分解表达式,同时给出了一些特殊情形下队长的随机分解结果.     

基于Max(N,D)策略的MG1排队系统的稳态指标

考虑一个由N策略和D策略同时控制的MG1排队系统.当顾客的到达个数至少为N个同时等待顾客的服务时间之和大于某非负实数D时,空闲的服务台重新开始服务顾客(称此服务启动策略为Max(N,D)策略).在此策略下,由于闲期到达顾客的服务时间是条件相依的,故队长的随机分解不再成立.通过将顾客分成两类,并借助拉普拉斯变换和概率分析,研究了该排队系统的稳态队长分布、稳态闲期和忙期分布、稳态服务时间积压量分布以及顾客的稳态逗留时间分布.数值算例分析了N、D和Max(N,D)策略对稳态平均队长的影响.在数值上获得了系统稳态费用最小的最优策略临界值,并比较了N、D、Max(N,D)和Min(N,D)策略的优越性.     

An M/G/1 Queueing System with Delay Server Vacations

ＡｎＭ／Ｇ／１ＱｕｅｕｅｉｎｇＳｙｓｔｅｍｗｉｔｈＤｅｌａｙＳｅｒｖｅｒＶａｃａｔｉｏｎｓ⒇ＴＡＮＧＹｉｎｇｈｕｉＴＡＮＧＸｉａｏｗｏ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈ．,Ｍａｎａｇｅｍｅｎｔｃｏｌｅｇｅ,Ｕｎｉｖｅｒ．ｏｆＥｌｅｃｔｒ...     

一类集散货物路线问题的禁忌搜索算法设计

针对该类同时集散货物路线问题(VRPSDP)的特点,文章将配送中心车辆的固定费用和可变费用之和作为目标函数.然后,提出了一种SFC-TS算法:先应用分形理论中的空间填充曲线法(SpacefillingCurves,SFC)求解初始解,再用禁忌搜索法(Tabu Search Algorithm,TS)对初始解进行改进优化.最后,应用算例验证了SFC-TS算法的有效性,结果表明SFC-TS算法在求解小规模问题(20个点)时其性能总体优于已有的同类问题的算法.     

收费广场内车辆排队系统的仿真研究

由于车型的多样性，收费广场内车辆排队系统是多随机输入流的，且排队长度不能仅计算队列中的车辆数量，这与经其的M／M／k和M／G／k排队模型是有差异的，介绍了不同的车型采用加权因子来计算队长的模型，用MATLAB软件编程来仿真这一复杂的车辆排队系统，得出了收费亭的车辆通行能力与收费亭数量及平均队长的变化规律。实践表明仿真算法稳定有效，所得结果更加符合实际情况。我们还用M／M／k排队理论公式对仿真模型进行了检验，结果二者吻合良好。     

一对多交互式在线客户服务排队模型

以聊天工具为基础的在线客服大量取代了电话形式的传统客服.与电话客服不同,一个在线客服人员能同时为多个顾客提供交互式的服务,而传统的排队公式都是以一对一服务为基础推导的,无法直接用来计算在线客服的排队指标.分析了一对多交互模式下的排队特点,提出了该模式下的服务水平指标,构建了包含顾客层和消息层的双层排队模型,推导了系统平...