✦ LIBER ✦

Dynamic server assignment in a two-queue model

✍ Scribed by O.J. Boxma; D.G. Down

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 876 KB
Volume: 103
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(97)82089-9

No coin nor oath required. For personal study only.

✦ Synopsis

We consider a polling model of two M/G~1 queues, served by a single server. The service policy for this polling model is of threshold type. Service at queue 1 is exhaustive. Service at queue 2 is exhaustive unless the size of queue 1 reaches some level T during a service at queue 2; in the latter case the server switches to queue 1 at the end of that service. Both zero-and nonzero switchover times are considered. We derive exact expressions for the joint queue length distribution at customer departure epochs, and for the steady-state queue-length and sojourn time distributions. In addition, we supply a simple and very accurate approximation for the mean queue lengths, which is suitable for optimization purposes. (~) 1997 Elsevier Science B.V.

📜 SIMILAR VOLUMES

Dynamic server assignment policies for a

Dynamic server assignment policies for assembly-type queues with flexible servers

✍ Yi-Chun Tsai; Nilay Tanık Argon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a

Optimal assignment policy of a single se

Optimal assignment policy of a single server attended by two queues

✍ Magdi S. Moustafa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 380 KB

An assignment problem for a parallel que

An assignment problem for a parallel queueing system with two heterogeneous servers

✍ J. Koyanagi; H. Kawai 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 575 KB

A single-server priority queueing-locati

A single-server priority queueing-location model

✍ Rajan Batta; Richard C. Larson; Amedeo R. Odoni 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

A multi-server queueing model with locki

A multi-server queueing model with locking

✍ Ivo Adan; Ton de Kok; Jacques Resing 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 179 KB

In this paper we analyse a multi-server queueing model with locking. The model is motivated by a situation we encountered at a maintenance facility for trains. Maintenance is done at parallel tracks, where each track oers space to two trains. Trains can enter and leave the tracks from one and the sa

Assigning a single server to inhomogeneo

Assigning a single server to inhomogeneous queues with switching costs

✍ Ger Koole 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 882 KB

In this paper we study the preemptive assignment of a single server to two queues. Customers arrive at both queues according to Poisson processes, and all service times are exponential, but with rates depending on the queues. The costs to be minimized consist of both holding costs and switching cost