On the optimality of exhaustive service policies in multiclass queueing systems with modulated arrivals and switchovers

Narahari, Y and Hemachandra, N (1997) On the optimality of exhaustive service policies in multiclass queueing systems with modulated arrivals and switchovers. In: Sadhana : Academy Proceedings in Engineering Sciences, 22 (part 1). pp. 69-82.

Preview

PDF On_the_optimality_of_exhaustive.pdf - Published Version Download (724kB)

Abstract

Consider a single-server multiclass queueing system with K classes where the individual queues are fed by K-correlated interrupted Poisson streams generated in the states of a K-state stationary modulating Markov chain. The service times for all the classes are drawn independently from the same distribution. There is a setup time (and/or a setup cost) incurred whenever the server switches from one queue to another. It is required to minimize the sum of discounted inventory and setup costs over an infinite horizon. We provide sufficient conditions under which exhaustive service policies are optimal. We then present some simulation results for a two-class queueing system to show that exhaustive, threshold policies outperform non-exhaustive policies.

Item Type:	Journal Article
Publication:	Sadhana : Academy Proceedings in Engineering Sciences
Publisher:	Indian Academy of Sciences
Additional Information:	Copyright of this article belongs to Indian Academy of Sciences.
Keywords:	Multiclass-queue;MMPP arrivals;setup times;exhaustive policies.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	17 Jun 2011 05:22
Last Modified:	17 Jun 2011 05:22
URI:	http://eprints.iisc.ac.in/id/eprint/38338

Actions (login required)

View Item