具有两个服务阶段的负顾客Mξ/(G1,G2)/1休假排队系统

研究一类批到达排队系统,单服务台提供两个不同阶段的服务,并且考虑空竭服务单重休假和有负顾客到达的情形.正顾客接受第一个阶段服务后立即接受第二个阶段服务,在正顾客接受两个阶段服务的过程中均可能有负顾客到达,负顾客不接受服务,只抵消正在接受服务的正顾客.运用补充变量法列出稳态下系统的状态偏微积分方程组,从而求得了系统主要排队指标及稳态队长的概率母函数的随机分解结果.     

具有启动失效的MAP/G/1一般重试系统分析

考虑具有启动失效的M AP/G/1一般重试排队系统,即系统中顾客在服务台空闲或服务结束时,以概率θ成功接受服务,而以概率=θ1-θ服务失效,并且服务台开始处于修理期。利用补充变量法和RG分解求得稳态时系统的队长分布以及系统的平均忙期等指标。     

服务台可修的M／G／1排队系统的进一步分析

在文［１］的基础上，本文进一步讨论了如下问题：１）在广义服务时间和系统忙期内服务台的失效次数；２）在（０，ｔ］内服务台平均失效次数的渐近展；３）在广义服务时间和系统忙期内服务台总的失效时间，并得到一系列新结果.     

基于AQM有多类数据流输入的多服务台节点模型

在区分各类数据流要求的基础上,建立了一个容量有限、多优先级、多服务台排队系统的AQM管理模型,该模型假定到达过程为泊松过程,服务台处理任一类数据包的时间是相同的.通过分析该模型的总体性能,推导出了系统的平均队长、响应时间、丢包率、吞吐量和平均等待时间.最后的数值分析进一步说明了服务台个数和各性能参数之间的关系.     

延迟多重休假离散时间的Geomx/G/1可修排队系统的可靠性指标

首次考虑延迟多重休假离散时间成批到达的Geomx/G/1可修排队系统的可靠性指标,在假定到达间隔时间和服务台的寿命服从几何分布,而服务时间、延迟休假时间、休假时间和服务台失效后的修理时间均服从一般离散分布下,使用一种新的分解方法讨论了服务台如下的可靠性问题:1)在时刻n服务台处于"广义忙期"的概率;2)服务台的瞬态和稳态不可用度;3)服务台在(0,n]时间内的平均失效次数;4)服务台在"广义忙期"内的平均失效次数.得到了一系列重要的可靠性结果.     

延迟多重休假离散时间的Geomx / G / 1可修排队系统的可靠性指标

首次考虑延迟多重休假离散时间成批到达的Geom^x / G / 1可修排队系统的可靠性指标,在假定到达间隔时间和服务台的寿命服从几何分布,而服务时间、延迟休假时间、休假时间和服务台失效后的修理时间均服从一般离散分布下,使用一种新的分解方法讨论了服务台如下的可靠性问题: 1)在时刻n服务台处于"广义忙期'的概率; 2）服务台的瞬态和稳态不可用度; 3) 服务台在( 0,n]时间内的平均失效次数;4)服务台在"广义忙期'内的平均失效次数.得到了一系列重要的可靠性结果.     

多服务台服务同一故障机器的可修系统分析

本文研究M/M/R机器可修问题，假设多个服务台可服务同台故障机器.用矩阵分析方法得到了系统的稳态概率，并给出数值实例. 建立费用模型，讨论了维修率对系统指标的影响，并得到了最优维修率.     

考虑消费者策略行为的产品服务供应链动态定价与协调

针对一个制造商和一个服务集成商组成的产品服务供应链,考虑消费者向服务集成商购买产品服务系统时存在策略性等待行为,通过构建两个销售阶段的动态博弈模型,分析了产品服务系统价值、成本和服务价值占比等因素对消费者策略行为和均衡结果的影响,比较了分散式与集中式决策的绩效偏差,基于两阶段收益共享契约实现了供应链协调.研究表明:提高产品服务系统价值、服务价值占比能减少消费者策略行为,提高供应链及其成员的总利润;高产品服务系统价值、高服务价值占比虽能增加分散式决策下的系统利润,但也扩大了与集中式决策下的系统利润差距;收益共享契约能调整消费者的策略行为,即当服务价值占比较高时,可以通过价格调整来抑制消费者的策略行为实现供应链协调.     

由出租车和乘客构成的特殊结构排队系统仿真

出租车排队系统的特殊性体现在:1)服务台移动;2)服务台与服务对象双向排队等待;3)服务台具备主动搜索服务对象的能力;4)服务时间受到路网动态交通流和信号灯的影响。基于此,采用离散事件仿真技术模拟出租车在路网上搜索乘客并提供出行服务的动态过程。校核与验证的结果表明:仿真模型能够更真实和精确地描述出租车运营系统,仿真结果与实际系统是一致的。     

有限资源下串联排队系统的动态定价及其在汽车检测场的应用

本文考虑了有限资源约束下串联排队系统的速率控制以及动态定价问题.管理者不仅需要制定合适的动态价格来增加收益,还需要在资源有限的约束下,为串联的两个服务台分配合适的资源,达到减少成本,提高总体社会福利的目的.文中首先采用灵敏度分析技术求得依赖于状态的最优到达率和两个服务台各自的最优服务率.通过边际收益函数,建立了价格和到达率之间的关系表达式.然后在已得到的最优速率基础上,利用递归算法给出平均逗留时间,进而得到依赖于状态的最优价格.最后将上述理论应用到汽车检测场的动态定价问题之中.     

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.     

Optimal design for a retrial queueing system with state-dependent service rate

This paper considers a single server retrial queue in which a state-dependent service policy is adopted to control the service rate. Customers arrive in the system according to a Poisson process and the service times and inter-retrial times are all exponentially distributed. If the number of customers in orbit is equal to or less than a certain threshold, the service rate is set in a low value and it also can be switched to a high value once this number exceeds the threshold. The stationary distribution and two performance measures are obtained through the partial generating functions. It is shown that this state-dependent service policy degenerates into a classic retrial queueing system without control policy under some conditions. In order to achieve the social optimal strategies, a new reward-cost function is established and the global numerical solutions, obtained by Canonical Particle Swarm Optimization algorithm, demonstrate that the managers can get more benefits if applying this state-dependent service policy compared with the classic model.     

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.     

ON THE TRANSIENT DEPARTURE PROCESS OF M^x/G/1 QUEUEING SYSTEM WITH SINGLE SERVER VACATION

This paper studies the transient departure process of M^x/G/1 queueing system with single server vacation. We present a simple probability decomposition method to derive the expected number of departures occurring in finite time interval from any initial state and the asymptotic expansion of the expected number. Especially, we derive some more practical results for some special cases.     

Analysis of a discrete-time GI/Geo/1/N queue with multiple working vacations

This paper analyzes a finite-buffer renewal input single server discrete-time queueing system with multiple working vacations. The server works at a different rate rather than completely stopping working during the multiple working vacations. The service times during a service period, service time during a vacation period and vacation times are geometrically distributed. The queue is analyzed using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at pre-arrival, arbitrary and outside observer’s observation epochs. The analysis of actual waiting-time distribution and some performance measures are carried out. We present some numerical results and discuss special cases of the model.     

推广的$M^x$/G(M/G)/1(M/G)可修排队系统(Ⅱ)—— 一些可靠性指标

进一步研究推广的$M^x$/G(M/G)/1(M/G)可修排队系统,讨论了服务台如下的可靠性问题:1)在时刻t失效的概率,即不可用度;2)在“服务员忙期”内的失效次数;3)在(0,t]内的平均失效次数及其渐近展开;4)在“服务员忙期”内的失效时间;5)在(0,t]内的平均失效时间及其渐近展开,得到一系列结果,并给出了便于计算(0,t]内的平均失效次数和平均失效时间的近似式.     

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.     

Reliability indices of discrete-time Geox/G/1 queueing system with unreliable service station and multiple adaptive delayed vacations

This paper considers the discrete-time Geo~x/G/1 queueing model with unreliable service station and multiple adaptive delayed vacations from the perspective of reliability research.Following problems will be discussed:1) The probability that the server is in a "generalized busy period" at time n;2) The probability that the service station is in failure at time n,i.e.,the transient unavailability of the service station,and the steady state unavailability of the service station;3) The expected number of service station failures during the time interval(0,n],and the steady state failure frequency of the service station;4) The expected number of service station breakdowns in a server’s "generalized busy period".Finally,the authors demonstrate that some common discrete-time queueing models with unreliable service station are special cases of the model discussed in this paper.     

推广的M~x/G(M/G)/1(M/G)可修排队系统(Ⅱ)—— 一些可靠性指标

进一步研究推广的MxG(MG)1(MG)可修排队系统,讨论了服务台如下的可靠性问题:1)在时刻t失效的概率,即不可用度;2)在“服务员忙期”内的失效次数;3)在(0,t]内的平均失效次数及其渐近展开;4)在“服务员忙期”内的失效时间;5)在(0,t]内的平均失效时间及其渐近展开,得到一系列结果,并给出了便于计算(0,t]内的平均失效次数和平均失效时间的近似式     

Some Reliability Problems Arising in the M~x/G(M/G)/1 Repairable Queueing System with Single Delay Vacation

1　 IntroductionIn Ref.[1 ] some queueing indices of the Mx/ G( M/ G) / 1 repairable queueing system withsingle delay vacation were discussed,and the transient solution,stationary solution andstochastic decomposition of the queue length were obtained.Butwhile the service stationis up and operating,it is subject to breakdowns.Once the service station breaks down,there is a repair operation that bring the broken service station back to a new state andoperation immediately.So it is important to…