We consider a tandem queue with coupled processors and analyze the two-dimensional Markov process representing the numbers of jobs in the two stations. A functional equation for the generating function of the stationary distribution of this two-dimensional process is derived and solved through the theory of Riemann-Hilbert boundary value problems.
Dynamic admission control strategies are of increasing importance as revenue management tools in service and manufacturing systems. In telecommunications and in particular in telephone service and support applications, such strategies are commonly used in order to increase flexibility in the allocation of resources among different customer types. In this… (More)
We study a class of queueing control problems involving commonly used control mechanisms such as admission control, pricing, and service rate control. Such controls are frequently employed in modeling service systems, telecommunications , and also in inventory systems modeled as make-to-stock queues. It is by now well established that in a number of such… (More)
We consider the problem of dynamic admission control in a multi-class Markovian loss system receiving random batches, where each admitted class-i job demands an exponential service with rate µ, and brings a reward r i. We show that the optimal admission policy is a sequential threshold policy with monotone thresholds.
This paper models the cross-selling problem of a call center as a dynamic service rate control problem. The question of when and to whom to cross-sell is explored using this model. The analysis shows that under the optimal policies cross-selling targets may be a function of the operational system state. Sufficient conditions are established for the… (More)
Calls of two classes arrive at a call center according to two independent Poisson processes. The center has two dedicated stations, one for each class, and one shared station. All three stations consist of parallel servers and no waiting room. Calls of each type demand exponential service times with different service rates and generate different rewards.… (More)
The purpose of this paper is to investigate the structural properties of the optimal batch acceptance policy in a Markovian queueing system where different classes of customers arrive in batches and the buffer capacity is finite. We prove that the optimal policy can possess certain monotonicity properties under the assumptions of a single-server and… (More)
We consider dynamic pricing and replenishment decisions for a production/inventory system modeled by a make-to-stock queue. The potential customer demand is generated by a Markov-Modulated (environment-dependent) Poisson process and the actual demand depends on the price offered at the time of the transaction. Using a Markov Decision Process framework, we… (More)
We acknowledge Tingliang Huang's technical assistance in the random coefficient logit estimation and thank the bank for providing us with the data. We thank Serdar Sayman, Zeynep Gurhan Canli, Lerzan Aksoy and Skander Esseghaier for their comments on an earlier version. Zeynep Aksin would like to acknowledge financial support from TUBITAK, The Abstract… (More)