Parametric nonlinear programming approach to fuzzy queues with bulk service

This paper proposes a procedure to construct the membership functions of the performance measures in bulk service queuing systems with the arrival rate and service rate are fuzzy numbers. The basic idea is to transform a fuzzy queue with bulk service to a family of conventional crisp queues with bulk service by applying the α-cut approach. On the basis of α-cut representation and the extension principle, a pair of parametric nonlinear programs is formulated to describe that family of crisp bulk service queues, via which the membership functions of the performance measures are derived. To demonstrate the validity of the proposed procedure, two fuzzy queues often encountered in transportation management are exemplified. Since the performance measures are expressed by membership functions rather than by crisp values, they completely conserve the fuzziness of input information when some data of bulk-service queuing systems are ambiguous. Thus the proposed approach for vague systems can represent the system more accurately, and more information is provided for designing queuing systems in real life. By extending to fuzzy environment, the bulk service queuing models would have wider applications.     

基于排队论的专项汽修厂维修台配置数量研究

为了解决因维修台配置不合理而导致的专项汽修厂排队等待的问题,运用排队论等理论和方法,采用先到先修理与维修台带有优先权相结合的排队规则,将维修台配置数量问题转化为两类型服务台排队问题,建立了单队列M/M/s1+s2/K/∞/FCFS+PS排队模型.通过对某专项汽修厂相关的数据采集和分析,得到了模型所需的变量和参数,运用边际效益法进行优化,得到了节假日和非节假日客流高峰期的最优维修台配置数量.通过对系统服务强度、系统资源限制和服务时间段等因素的分析,既能保证排队系统可以在不同时间段内对维修台配置数量进行调整,又能缩小最优值的求解范围.     

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

多服务台并联排队系统的随机模拟

针对多服务台并联排队系统,提出了计算机随机模拟的方法.分别研究了基本和非基本排队系统中,诸如排队人数、排队时间、平稳分布、忙期及其忙期服务人数等各项排队指标的模拟求解方法.通过模拟例子和实际数据分析,显示了本文所提模拟方法的有效性、灵活性和实用性.     

Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline

The dual queue consists of two queues, called the primary queue and the secondary queue. There is a single server in the primary queue but the secondary queue has no service facility and only serves as a holding queue for the overloaded primary queue. The dual queue has the additional feature of a priority scheme to help reduce congestion. Two classes of customers, class 1 and 2, arrive to the dual queue as two independent Poisson processes and the single server in the primary queue dispenses an exponentially distributed service time at the rate which is dependent on the customer’s class. The service discipline is preemptive priority with priority given to class 1 over class 2 customers. In this paper, we use matrix-analytic method to construct the infinitesimal generator of the system and also to provide a detailed analysis of the expected waiting time of each class of customers in both queues.     

Stability and delay of distributed scheduling algorithms for networks of conflicting queues

This paper explains recent results on distributed algorithms for networks of conflicting queues. At any given time, only specific subsets of queues can be served simultaneously. The challenge is to select the subsets in a distributed way to stabilize the queues whenever the arrival rates are feasible. One key idea is to formulate the subset selection as an optimization problem where the objective function includes the entropy of the distribution of the selected subsets. The dual algorithm for solving this optimization problem provides a distributed scheduling algorithm that requires only local queue-length information. The algorithm is based on the CSMA (Carrier Sense Multiple Access) protocol in wireless networks. We also explain recent results, some of them unpublished so far, on the delay properties of these algorithms. In particular, we present a framework for queuing stability under bounded CSMA parameters, and show how the expected queue lengths depend on the throughput region to be supported. When the arrival rates are within a fraction of the capacity region, queue lengths that are polynomial (or even logarithmic) in the number of queues can be achieved.     

Analysis of BMAP/G/1 Queue with Reservation of Service

Abstract

In this article, we study BMAP/G/1 queue with service time distribution depending on number of processed items. This type of queue models the systems with the possibility of preliminary service. For the considered system, an efficient algorithm for calculating the stationary queue length distribution is proposed, and Laplace–Stieltjes transform of the sojourn time is derived. Little's law is proved. An optimization problem is considered.     

The cyclic queue and the tandem queue

We consider a closed queueing network, consisting of two FCFS single server queues in series: a queue with general service times and a queue with exponential service times. A fixed number \(N\) of customers cycle through this network. We determine the joint sojourn time distribution of a tagged customer in, first, the general queue and, then, the exponential queue. Subsequently, we indicate how the approach toward this closed system also allows us to study the joint sojourn time distribution of a tagged customer in the equivalent open two-queue system, consisting of FCFS single server queues with general and exponential service times, respectively, in the case that the input process to the first queue is a Poisson process.     

基于排队模型的电动汽车充电桩数量优化设计

通过对电动汽车充电行为的分析,采用顾客带有不耐烦和止步行为的有限容量M/M/C/N排队模型对充电场所充电服务系统进行建模.通过求解模型的平衡方程,获得系统稳态下的队长分布及其它多项性能指标.以系统性能指标为基础,从经济效益与社会效益的角度提出了充电服务系统优化设计的目标函数,并通过数字例子对优化模型进行了说明.分析了模型参数对系统充电桩最优配置数的影响,从中可看出,系统容量、顾客的不耐烦率及顾客的止步概率等参数对充电桩数量的优化设计都会产生不可忽视的影响.     

Bayesian prediction inM/M/1 queues

Simple queues with Poisson input and exponential service times are considered to illustrate how well-suited Bayesian methods are used to handle the common inferential aims that appear when dealing with queue problems. The emphasis will mainly be placed on prediction; in particular, we study the predictive distribution of usual measures of effectiveness in anM/M/1 queue system, such as the number of customers in the queue and in the system, the waiting time in the queue and in the system, the length of an idle period and the length of a busy period.     

Two Queues with Weighted One-Way Overflow

We consider an open queueing network consisting of two queues with Poisson arrivals and exponential service times and having some overflow capability from the first to the second queue. Each queue is equipped with a finite number of servers and a waiting room with finite or infinite capacity. Arriving customers may be blocked at one of the queues depending on whether all servers and/or waiting positions are occupied. Blocked customers from the first queue can overflow to the second queue according to specific overflow routines. Using a separation method for the balance equations of the two-dimensional server and waiting room demand process, we reduce the dimension of the problem of solving these balance equations substantially. We extend the existing results in the literature in three directions. Firstly, we allow different service rates at the two queues. Secondly, the overflow stream is weighted with a parameter p ∈ [0,1], i.e., an arriving customer who is blocked and overflows, joins the overflow queue with probability p and leaves the system with probability 1 − p. Thirdly, we consider several new blocking and overflow routines. An erratum to this article can be found at     

Queues with Service Rate Controlled by a Delayed Feedback

We consider a single queue with a Markov modulated Poisson arrival process. Its service rate is controlled by a scheduler. The scheduler receives the workload information from the queue after a delay. This queue models the buffer in an earth station in a satellite network where the scheduler resides in the satellite. We obtain the conditions for stability, rates of convergence to the stationary distribution and the finiteness of the stationary moments. Next we extend these results to the system where the scheduler schedules the service rate among several competing queues based on delayed information about the workloads in the different queues.     

带有止步和状态相依的M/Ej/1/N排队系统的矩阵解法

研究了带有止步和服务率依赖于状态的M/Ej/1/N排队系统.顾客到达系统时,以一定的概率选择进入系统或止步(不进入系统).顾客接受服务的服务率依赖于系统中的顾客数,当系统中的顾客数不超过临界值k时,服务员慢速服务;否则,服务员快速服务.利用分块矩阵的方法,推出了稳态概率向量所满足的矩阵形式的迭代公式,给出了稳态概率的表达式和计算过程.作为特例,考虑了N=4时系统稳态概率的计算.在此基础上,还求出了系统的一些性能指标,并建立了以临界值k为控制变量的费用模型.通过数值分析,求出了使费用函数最小的最优临界值k*,并进一步研究了模型参数对最优临界值和最优费用的影响.     

A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime

Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival to queue 1 while the server is still working in queue 0, the latter is immediately gated, and the server completes service there only to the gated jobs, upon which it switches back to the primary queue. We formulate this system as a two-queue polling model with a single alternating server and with randomly-timed gated (RTG) service discipline in queue 0, where the timer there depends on the arrival stream to the primary queue. We derive Laplace–Stieltjes transforms and generating functions for various key variables and calculate numerous performance measures such as mean queue sizes at polling instants and at an arbitrary moment, mean busy period duration and mean cycle time length, expected number of messages transmitted during a busy period and mean waiting times. Finally, we present graphs of numerical results comparing the mean waiting times in the two queues as functions of the relative loads, showing the effect of the RTG regime.     

Distributional Form of Little's Law for FIFO Queues with Multiple Markovian Arrival Streams and Its Application to Queues with Vacations

This paper considers stationary queues with multiple arrival streams governed by an irreducible Markov chain. In a very general setting, we first show an invariance relationship between the time-average joint queue length distribution and the customer-average joint queue length distribution at departures. Based on this invariance relationship, we provide a distributional form of Little's law for FIFO queues with simple arrivals (i.e., the superposed arrival process has the orderliness property). Note that this law relates the time-average joint queue length distribution with the stationary sojourn time distributions of customers from respective arrival streams. As an application of the law, we consider two variants of FIFO queues with vacations, where the service time distribution of customers from each arrival stream is assumed to be general and service time distributions of customers may be different for different arrival streams. For each queue, the stationary waiting time distribution of customers from each arrival stream is first examined, and then applying the Little's law, we obtain an equation which the probability generating function of the joint queue length distribution satisfies. Further, based on this equation, we provide a way to construct a numerically feasible recursion to compute the joint queue length distribution.     

Symmetric queues served in cyclic order

Consider a symmetrical system of n queues served in cyclic order by a single server. It is shown that the stationary number of customers in the system is distributed as the sum of three independent random variables, one being the stationary number of customers in a standard M/G/1 queue. This fact is used to establish an upper bound for the mean waiting time for the case where at most k customers are served at each queue per visit by the server. This approach is also used to rederive the mean waiting times for the cases of exhaustive service, gated service, and serve at most one customer at each queue per visit by the server.     

无阻塞概率下的排队效率分析

排队在日常生活当中屡见不鲜,为了使顾客排队等待的时间尽可能减少,除了合理安排工作人员的服务质量及服务设备外,还应该考虑如何安排排队更有效。本文在通讯系统排队问题分析的基础上,在假设阻塞概率趋近于零的情况下,比较了不同排队方式下的效率,得出结论：排成一个大队要优于排成几个小队。     

Heavily loaded queue coupled to two underloaded queues

We consider a system of three parallel queues with Poisson arrivals and exponentially distributed service requirements. The service rate for the heavily loaded queue depends on which of the two underloaded queues are empty. We derive the lowest-order asymptotic approximation to the joint stationary distribution of the queue lengths, in terms of a small parameter measuring the closeness of the heavily loaded queue to instability. To this order the queue lengths are independent, and the underloaded queues and the heavily loaded queue have geometrically and, after suitable scaling, exponentially distributed lengths, respectively. The expression for the exponential decay rate for the heavily loaded queue involves the solution to an inhomogeneous linear functional equation. Explicit results are obtained for this decay rate when the two underloaded queues have vastly different arrival and service rates.     

带有止步和中途退出的成批到达的Mx/M/1/N多重休假排队系统的性能分析

本文研究了带有止步和中途退出的M^x／M/1／N多重休假排队系统。顾客成批到达，到达后每批中的顾客，或者以概率b决定进入队列等待服务，或者以概率1-b止步（不进入系统）。顾客进入系统后可能因为等待的不耐烦而在没有接受服务的情况下离开系统（中途退出）。系统中一旦没有顾客，服务员立即进行多重休假。首先，利用马尔科夫过程理论建立了系统稳态概率满足的方程组。其次，在利用高等代数相关知识证明了相关矩阵可逆性的基础上，利用矩阵解法求出了稳态概率的矩阵解，并得到了系统的平均队长、平均等待队长以及顾客的平均损失率等性能指标。     

Analysis of flexible manufacturing systems with priority scheduling: PMVA

A new methodology for performance analysis of flexible manufacturing systems (FMSs) with priority scheduling is presented. The analytic model developed extends the mean value analysis of closed networks of queues with multiple product types, various non-preemptive priority service disciplines, and with parallel machine stations. Performance measures derived include the expected throughput per product and per station, utilization of machines and transporters, queuing times and queue length measures for various configurations. Extensive numerical calculations have shown that the algorithm used for solving the problem converges rapidly and retains numerical stability for large models. The paper also illustrates the application of the model to a system with a mixture of FCFS and HOL disciplines which gives insights into various priority assignment policies in FMSs. Special attention was given to the problem of scheduling the robot carriers (transporters).