ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems

Hemachandra, N and Narahari, Y (2000) A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems. In: Queueing Systems, 36 (4). 443-461.

[img] PDF
optimal.pdf - Published Version
Restricted to Registered users only

Download (120Kb) | Request a copy
Official URL: http://www.springerlink.com/content/mu7w21k4209324...

Abstract

Motivated by certain situations in manufacturing systems and communication networks, we look into the problem of maximizing the profit in a queueing system with linear reward and cost structure and having a choice of selecting the streams of Poisson arrivals according to an independent Markov chain. We view the system as a MMPP/GI/1 queue and seek to maximize the profits by optimally choosing the stationary probabilities of the modulating Markov chain. We consider two formulations of the optimization problem. The first one (which we call the PUT problem) seeks to maximize the profit per unit time whereas the second one considers the maximization of the profit per accepted customer (the PAC problem). In each of these formulations, we explore three separate problems. In the first one, the constraints come from bounding the utilization of an infinite capacity server; in the second one the constraints arise from bounding the mean queue length of the same queue; and in the third one the finite capacity of the buffer reflect as a set of constraints. In the problems bounding the utilization factor of the queue, the solutions are given by essentially linear programs, while the problems with mean queue length constraints are linear programs if the service is exponentially distributed. The problems modeling the finite capacity queue are non-convex programs for which global maxima can be found. There is a rich relationship between the solutions of the PUT and PAC problems. In particular, the PUT solutions always make the server work at a utilization factor that is no less than that of the PAC solutions.

Item Type: Journal Article
Additional Information: Copytright of this article belongs to Springer.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 09 Aug 2010 10:41
Last Modified: 19 Sep 2010 06:13
URI: http://eprints.iisc.ernet.in/id/eprint/31134

Actions (login required)

View Item View Item