N-策略工作休假M/M/1排队系统中的顾客行为研究

考虑N-策略M/M/1排队,休假期间服务员并未停止工作而是以较低的速率为顾客服务.系统的决策主体是顾客,基于"收益-成本"结构,利用马尔可夫过程理论,采取均值分析的方法,以顾客追求利益最大化为出发点,分析了全可见和几乎可见两种情况下的顾客行为.通过求解平衡方程,得到几乎可见情况下系统的稳态概率,进而求得几乎可见状态下顾客的期望逗留时间.构建均衡社会收益函数,并通过数值模拟,分析系统的各个参数对社会均衡收益的影响.     

Strategic Behavior and Optimization in an Unobservable Constant Retrial Queue with Balking and Set-Up Time

An M/M/1 constant retrial queue with balking customers and set-up time is considered.Once the system becomes empty, the server will be turned down to reduce operating costs, and it will be activated only when there is a customers arrives. In this paper, the almost unobservable case is studied, in which the information of the queue length is unavailable, whereas the state of the server can be obtained. Firstly, the steady state solutions are derived and the individual equilibrium strategies are analyzed. In addition, social optimization problems, including cost analysis and social welfare maximization are investigated by using the PSO algorithm. Finally, by appropriate numerical examples, the sensitivity of some main system parameters is shown.     

AVAILABILITY ANALYSIS OF THE QUEUEING SYSTEM GI/PH/I WITH SERVER BREAKDOWNS

In the existing literature of Repairable Queueing Systems (RQS), i.e., queueing systems with server breakdowns, it is almost all assumed that interarrival times of successive customers are independent, identically exponentially distributed. In this paper, we deal with more generic system GI/PH/1 with server's exponential uptime and phase-type repair time. With matrix analysis theory, we establish the equilibrium condition and the characteristics of the system, derive the transient and stationary availability behavior of the system.     

基于M/M/1/SV排队的均衡门限策略

考虑单重休假M/M/1排队, 在部分可视的前提下, 研究顾客的均衡门限策略, 首次将单重休假机制引入到连续时间排队经济学模型中. 系统的决策主体是顾客, 突破了以往只注重服务机构单方面行为的局限. 基于“收入-支出”结构, 利用马尔可夫过程理论, 通过求解差分方程, 分析了系统的稳态行为, 得到了顾客的平均逗留时间; 进而构造适当的函数, 给出了寻找 均衡纯门限策略, 均衡混合门限策略的具体方法并证明之; 而后在不同的策略下, 得出了系统的稳态分布和均衡社会收益; 最后, 通过数值实验分析了均衡行为的各指标对系统参数的敏感性. 研究结果为顾客决策提供了优化建议, 同时为管理者研究系统中的定价问题提供了理论参考.     

A batch arrival retrial queue with starting failures,feedback and admission control

This paper is concerned with the analysis of a feedback M^[X]/G/1 retrial queue with starting failures and general retrial times. In a batch, each individual customer is subject to a control admission policy upon arrival. If the server is idle, one of the customers admitted to the system may start its service and the rest joins the retrial group, whereas all the admitted customers go to the retrial group when the server is unavailable upon arrival. An arriving customer (primary or retrial) must turn-on the server, which takes negligible time. If the server is started successfully (with a certain probability), the customer gets service immediately. Otherwise, the repair for the server commences immediately and the customer must leave for the orbit and make a retrial at a later time. It is assumed that the customers who find the server unavailable are queued in the orbit in accordance with an FCFS discipline and only the customer at the head of the queue is allowed for access to the server. The Markov chain underlying the considered queueing system is studied and the necessary and sufficient condition for the system to be stable is presented. Explicit formulae for the stationary distribution and some performance measures of the system in steady-state are obtained. Finally, some numerical examples are presented to illustrate the influence of the parameters on several performance characteristics.     

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

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

Queue Size Distribution of Geo/G/1 Queue Under the Min(N,D)-Policy

This paper considers a discrete-time Geo/G/1 queue under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the waiting customers exceeds D,whichever occurs first(Min(N,D)-policy).By using renewal process theory and total probability decomposition technique,the authors study the transient and equilibrium properties of the queue length from the beginning of the arbitrary initial state,and obtain both the recursive expression of the z-transformation of the transient queue length distribution and the recursive formula for calculating the steady state queue length at arbitrary time epoch n~+.Meanwhile,the authors obtain the explicit expressions of the additional queue length distribution.Furthermore,the important relations between the steady state queue length distributions at different time epochs n~-,n and n~+ are also reported.Finally,the authors give numerical examples to illustrate the effect of system parameters on the steady state queue length distribution,and also show from numerical results that the expressions of the steady state queue length distribution is important in the system capacity design.     

The M/M/1 queue with working vacations and vacation interruptions

In this paper, we study the M/M/1 queue with working vacations and vacation interruptions. The working vacation is introduced recently, during which the server can still provide service on the original ongoing work at a lower rate. Meanwhile, we introduce a new policy：, the server can come back from the vacation to the normal working level once some indices of the system, such as the number of customers, achieve a certain value in the vacation period. The server may come back from the vacation without completing the vacation. Such policy is called vacation interruption. We connect the above mentioned two policies and assume that if there are customers in the system after a service completion during the vacation period, the server will come back to the normal working level. In terms of the quasi birth and death process and matrix-geometric solution method, we obtain the distributions and the stochastic decomposition structures for the number of customers and the waiting time and provide some indices of systems.     

Performance Analysis of a Discrete-Time Queue with Working Breakdowns and Searching for the Optimum Service Rate in Working Breakdown Period

This paper deals with a discrete-time Geo/Geo/1 queueing system with working breakdowns in which customers arrive at the system in variable input rates according to the states of the server. The server may be subject to breakdowns at random when it is in operation. As soon as the server fails, a repair process immediately begins. During the repair period, the defective server still provides service for the waiting customers at a lower service rate rather than completely stopping service.We analyze the stability condition for the considered system. Using the probability generating function technique, we obtain the probability generating function of the steady-state queue size distribution.Also, various important performance measures are derived explicitly. Furthermore, some numerical results are provided to carry out the sensitivity analysis so as to illustrate the effect of different parameters on the system performance measures. Finally, an operating cost function is formulated to model a computer system and the parabolic method is employed to numerically find the optimum service rate in working breakdown period.     

一类休假的Geo~X/G/1可修排队的可靠性分析

考虑单重休假、Bernoulli反馈和可变输入率的离散时间Geo~X/G/1可修排队.顾客的批到达速率与服务器的休假有关.刚服务完的顾客以概率1-θ进入队列寻求下次服务.服务器在服务过程中可能故障需修复后再继续工作.借助更新过程理论、z变换和一种分解法,研究了时刻n+位于服务器忙期的条件概率、服务器的瞬态和稳态不可用度以及(0~+,n~+]时间内服务器的平均故障次数和稳态故障频度,揭示了这类离散时间可修排队中服务器可靠性指标的结构,得到了一些特殊可修排队的可靠性结果.最后通过数值实例分析了系统参数对服务器可靠性指标的影响.     

Waiting Time of M/M/c/N Queuing System with Balking,Reneging, and Multiple Synchronous Vacations of Partial Servers

The policy of synchronous vacations of partial servers is considered in an multi-server queuing system with balking and reneging. Some fixed partial idle servers take synchronous multiple vacations when these servers become idle at an instant that a customer leaves the system. In this article, by considering the two cases that the partial servers are on vacation and not on vacation, the distributions of the conditional waiting time for customers who join the system when all the available servers are busy and eventually acquire service are obtained. Based on these, the distribution of the conditional waiting time of customers given that they join the system when all available servers are busy and eventually acquire service is derived.     

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...     

Analysis of batch arrival queue with randomized vacation policy and an un-reliable server

This paper examines an M^[x]G/1 queueing system with an unreliable server and a delayed repair,in which the server operates a randomized vacation policy with multiple vacations.Whenever the system is empty,the server immediately takes a vacation.If there is at least one customer found waiting in the queue upon returning from a vacation,the server will be immediately activated for service.Otherwise,if no customers are waiting for service at the end of a vacation,the server either remains idle with probability p or leaves for another vacation with probability 1-p.Whenever one or more customers arrive when the server is idle,the server immediately starts providing service for the arrivals.The server may also meet an unpredictable breakdown and the repair may be delayed.For such a system the authors derive the distributions of some important system characteristics,such as the system size distribution at a random epoch and at a departure epoch,the system size distribution at the busy period initiation epoch,and the distribution of the idle period and the busy period.The authors perform a numerical analysis for changes in the system characteristics,along with changes in specific values of the system parameters.A cost effectiveness maximization model is constructed to explain the benefits of such a queueing system.     

SINGLE SERVER QUEUES WITH A BATCH MARKOVIAN ARRIVAL PROCESS AND BULK RENEWAL OR NON-RENEWAL SERVICE

We first consider an infinite-buffer single server queue where arrivals occur according to a batch Markovian arrival process(BMAP).The server serves customers in batches of maximum size 'b' with a minimum threshold size 'a'.The service time of each batch follows general distribution independent of each other as well as the arrival process.The proposed analysis is based on the use of matrix-analytic procedure to obtain queue-length distribution at a post-departure epoch.Next we obtain queue-length distributions at various other epochs such as,pre-arrival,arbitrary and pre-service using relations with post-departure epoch.Later we also obtain the system-length distributions at post-departure and arbitrary epochs using queue-length distribution at post-departure epoch.Some important performance measures,like mean queue-lengths and mean waiting times have been obtained.Total expected cost function per unit time is also derived to determine the locally optimal values of a and b.Secondly,we perform similar analysis for the corresponding infinite-buffer single server queue where arrivals occur according to a BMAP and service process in this case follows a non-renewal one,namely,Markovian service process(MSP).     

部分可观测信息条件下系统最佳检修策略分析

针对部分可观测信息条件下的退化系统,提出利用部分可观测马尔可夫决策过程模型解决系统视情维修问题。采用隐马尔可夫模型对系统进行状态评估,得到系统的转移概率和观测概率矩阵;利用比例故障率模型对系统进行可靠性分析,得到系统的故障率和可靠度函数,不仅考虑系统的工作时间,也考虑系统的退化状态。最后,以系统长期运行的最小平均费用率为目标,得到最佳的检测周期和最优的更换策略。实例研究表明,该方法可为保障人员提供科学的维修决策依据。     

The Queue Length Distribution for M/G/1 Queue with Delay Single Server Vacation

1　IntroductionDuringrecentseveraldecadesmanyauthorsstudiedM/G/1queueswithdifferentservervacationregimes(seeRefs.[1～6]).Theynotonlystudiedthestochasticdecompositionpropertiesofthequeuelengthandwaitingtimewhenthesystemisinequilibrium,butalsostudiedthetransientandequilibriumdistributionsofthequeuelength.InRef.[6]theau-thorsstudiedM/G/1queuewithdelaymultipleservervacationsinwhichtheserverhasthreestates:vacation-preparation,vacationandbusyperiod.InthispaperwefirstdiscusstheM/G/1queuewithdelay…     

A discrete-time Geo/G/1 retrial queue with J-vacation policy and general retrial times

The authors discuss a discrete-time Geo/G/1 retrial queue with J-vacation policy and general retrial times. As soon as the orbit is empty, the server takes a vacation. However, the server is allowed to take a maximum number J of vacations, if the system remains empty after the end of a vacation. If there is at least one customer in the orbit at the end of a vacation, the server begins to serve the new arrivals or the arriving customers from the orbit. For this model, the authors focus on the steady-state analysis for the considered queueing system. Firstly, the authors obtain the generating functions of the number of customers in the orbit and in the system. Then, the authors obtain the closed-form expressions of some performance measures of the system and also give a stochastic decomposition result for the system size. Besides, the relationship between this discrete-time model and the corresponding continuous-time model is also investigated. Finally, some numerical results are provided.     

A comparative study of the inventory system with service facility and postponed demands

In this article, we present a continuous review （s,S） inventory system with a service facility consisting of finite buffer （capacity N ） and a single server. The customers arrive according to a Poisson process. The individual customer＇s unit demand is satisfied after a random time of service, which is assumed to be exponential. When the inventory level drops to s＇an order for Q（= S-s） items is placed. The lead time of reorder is assumed to be exponential distribution. An arriving customer, who finds the buffer is full, enters into the pool of infinite size or leaves the system according to a Bernolli trial. At the time of service completion, if the buffer size drops to a preassigned level L （1 〈 L 〈 N） or below and the inventory level is above s, we select the customers from the pool according to two different policy ： in first policy, with probability p （0 〈 p 〈 1） we select the customer from the head of the pool and we place the customer at the end of the buffer; in the second policy, with p （0 〈 p 〈 1） the customer from the pool is transferred to the buffer for immediate service and after completion of his service we provide service to the customer who is in the buffer with probability one. If at a service completion epoch the buffer turns out to be empty, there is at least one customer in the pool and the inventory level is positive, then the one ahead of all waiting in the pool gets transferred to the buffer, and his service starts immediately. The joint probability distribution of the number of customers in the pool, number of customers in the buffer and the inventory level is obtained in the steady-state case. Various stationary system performance measures are computed and total expected cost rate is calculated. A comparative result of two models is illustrate numerically.     

A single server retrial queue with general retrial times and two-phase service

An M / G / 1 retrial queue with a first-come-first-served (FCFS) orbit, general retrial time, two-phase service and server breakdown is investigated in this paper. Customers are allowed to balk and renege at particular times. Assume that the customers who find the server busy are queued in the orbit in accordance with an FCFS discipline. All customers demand the first “essential” service, whereas only some of them demand the second “optional” service, and the second service is multioptional. During the service, the server is subject to breakdown and repair. Assume that the retrial time, the service time, and the repair time of the server are all arbitrarily distributed. By using the supplementary variables method, the authors obtain the steady-state solutions for both queueing and reliability measures of interest. This research is supported by the National Natural Science Foundation of China under Grant No. 10871020.     

延迟多重休假MX/G/1排队系统的队长分布

考虑延迟多重休假的M^x／G／1排队，在假定延迟时间、休假时间和服务时间都是一般概率分布函数下，研究了队长的瞬态和稳态性质、通过引进“服务员忙期”，导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式，以及平稳队长的随机分解．