Approximations for the waiting time distribution in polling models with and without state-dependent setups

Authors:
Tava Lennon Olsen
Affiliations:
John M. Olin School of Business, Washington University in St. Louis, Campus Box 1133, St. Louis, MO 63130-4899, USA
Venue:
Operations Research Letters
Year:
2001

Citing 5
Cited 3

Mean waiting time evaluation of packet switches for centrally controlled PB's

Performance Evaluation
The stochastic Economic Lot Scheduling Problem: cyclical base-stock policies with idle times

Management Science
Polling Systems in Heavy Traffic: a Bessel Process Limit

Mathematics of Operations Research
A Practical Scheduling Method for Multiclass Production Systems with Setups

Management Science
Stochastic Analysis of Computer and Communication Systems

Stochastic Analysis of Computer and Communication Systems

LIMIT THEOREMS FOR POLLING MODELS WITH INCREASING SETUPS

Probability in the Engineering and Informational Sciences
Polling systems with periodic server routing in heavy traffic: renewal arrivals

Operations Research Letters
A Queueing Model to Evaluate the Impact of Patient “Batching” on Throughput and Flow Time in a Medical Teaching Facility

Manufacturing & Service Operations Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

A polling model is a queueing model where many job classes share a single server and a setup time is incurred whenever the server changes class. Polling models are applicable to many computing, telecommunications, and manufacturing environments. The scheduling method considered in this paper is a common policy known as cyclic, serve to exhaustion (CSE). Recently, Coffman, Puhalskii and Reiman (CPR) have developed a heavy-traffic approximation for the waiting time distribution in a CSE polling model. This paper presents three new approximations. Firstly, the CPR approximation and the traditional (non-heavy-traffic) polling model literature are combined to obtain a refinement of the CPR approximation. This refinement is much more accurate under conditions of moderate loading. Next, an approximation is made for the distribution of the number of jobs present in a queue upon it being polled. Lastly, the previous two approximations are combined to form an approximation for the waiting time distribution when setups are not performed for queues containing no jobs. A simulation study is undertaken to evaluate these three approximations.