Hostname: page-component-76fb5796d-9pm4c Total loading time: 0 Render date: 2024-04-25T16:29:11.444Z Has data issue: false hasContentIssue false

OPTIMAL CONTROL OF A TWO-STAGE TANDEM QUEUING SYSTEM WITH FLEXIBLE SERVERS

Published online by Cambridge University Press:  10 October 2002

Hyun-soo Ahn
Affiliation:
Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA 94720-1777, E-mail: ahn@ieor.berkeley.edu
Izak Duenyas
Affiliation:
Business School, Department of Operations Management, University of Michigan, Ann Arbor, MI 48109-1234, E-mail: duenyas@umich.edu
Mark E. Lewis
Affiliation:
Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117, E-mail: melewis@engin.umich.edu

Abstract

We consider the optimal control of two parallel servers in a two-stage tandem queuing system with two flexible servers. New jobs arrive at station 1, after which a series of two operations must be performed before they leave the system. Holding costs are incurred at rate h1 per unit time for each job at station 1 and at rate h2 per unit time for each job at station 2.

The system is considered under two scenarios; the collaborative case and the noncollaborative case. In the prior, the servers can collaborate to work on the same job, whereas in the latter, each server can work on a unique job although they can work on separate jobs at the same station. We provide simple conditions under which it is optimal to allocate both servers to station 1 or 2 in the collaborative case. In the noncollaborative case, we show that the same condition as in the collaborative case guarantees the existence of an optimal policy that is exhaustive at station 1. However, the condition for exhaustive service at station 2 to be optimal does not carry over. This case is examined via a numerical study.

Type
Research Article
Copyright
© 2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)