THE VALUE OF QUEUEING THEORY
- A QUICK AND DIRTY RESPONSE TO THE QUICK AND DIRTY CROWD; PARTICULARLY TO JACK BYRD'S 'THE VALUE OF QUEUEING THEORY' Kolesar, Peter // Interfaces;Feb79 Part1, Vol. 9 Issue 2, p77
In this article, the author discusses the importance of queuing theory in operations research and management science (OR/MS). Queuing theory is a useful, important part of the tool bag of OR/MS, and any half serious professional ought to know it. Many applications of queuing theory are so...
- Some Simpler Bounds on the Mean Queuing Time. Marchal, William G. // Operations Research;Nov/Dec78, Vol. 26 Issue 6, p1083
This note presents a general lower bound for the mean queuing time in a stationary GI/G/c queue. It also discusses the application of the bound to an M/G/c system and the general areas of usefulness.
- On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation. Stolyar, Alexander L. // Operations Research;Jan/Feb2005, Vol. 53 Issue 1, p12
We consider the model where N queues (users) are served in discrete time by a generalized switch. The switch state is random, and it determines the set of possible service rate choices (scheduling decisions) in each time slot. This model is primarily motivated by the problem of scheduling...
- AN IMBEDDED CHAIN APPROACH TO A QUEUE WITH MOVING AVERAGE INPUT. Pearce, C. // Operations Research;Nov/Dec67, Vol. 15 Issue 6, p1117
A generalization of the GI/M/1 queue is considered in which the interarrival times do not constitute an identically and independently distributed sequence but, are correlated. The transient behavior of the queue length is treated, both in continuous time and on an imbedded chain. The busy period...
- The Optimal Estimation of the Expected Number in a M/ D/ âˆž Queueing System. Grassmann, W. K. // Operations Research;Nov/Dec81, Vol. 29 Issue 6, p1208
This paper shows that in the M/D/oo queueing system with service time S, the optimal way to estimate the expected number in the system is by sampling the system at time 0, S, 2S, ... , /cS. In this way, the best unbiased estimate from a sampling interval of length T = kS can be obtained.
- Students' Compendium-Statistics. Gosling, G. P // Management Services;Jan1980, Vol. 24 Issue 1, p26
This article focuses on the Simulation and Monte Carlo Technique of XIII Queueing Theory. Queueing theory is applicable wherever items wait for service. These items can be passengers on a railway station, components in a machine shop, motor cars at a toll booth, aircraft waiting to land, fitters...
- Queing Theory: A Study of Waiting Lines for Business. Prabhu, N. U. // Operations Research;Fall70 Supplenment 2, Vol. 18 Issue 5, p956
The article focuses on a book "Queuing Theory: A Study of Waiting Lines for Business, Economics and Science," by Joseph A. Panico. This book is addressed to students of business, economics, engineering, and other disciplines of the physical and social sciences. It is written as a supplementary...
- CHARACTERIZATION AND OPTIMIZATION OF ACHIEVABLE PERFORMANCE IN GENERAL QUEUEING SYSTEMS. Federgruen, A.; Groenevelt, H. // Operations Research;Sep/Oct88, Vol. 36 Issue 5, p733
This paper considers general (single facility) queueing systems with exponential service times, dealing with a finite number J of distinct customer classes. Performance of the system, as measured by the vector of steady state expected sojourn times of the customer classes (the performance...
- MONOTONICITY OF THE THROUGHPUT OF A CLOSED QUEUEING NETWORK IN THE NUMBER OF JOBS. Adan, Ivo; Van Der Wal, Jan // Operations Research;Nov/Dec89, Vol. 37 Issue 6, p953
Using a sample path argument, it is shown that the throughput of a closed queueing network with general service times is nondecreasing in the number of jobs.