Fluid Limits for Processor-Sharing Queues with Impatience

Published Online:https://doi.org/10.1287/moor.1070.0298

We investigate a processor-sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue or renege before completing service. The random time representing a job's patience has a general distribution and may be dependent on its initial service time requirement. A scaling procedure that gives rise to a fluid model with nontrivial yet tractable steady state behavior is presented. This fluid model captures many essential features of the underlying stochastic model, and it is used to analyze the impact of impatience in processor-sharing queues.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.