Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T01:45:34.438Z Has data issue: false hasContentIssue false

The optimal admission policy to a multiserver queue with finite horizon

Published online by Cambridge University Press:  14 July 2016

H. Emmons*
Affiliation:
Cornell University

Abstract

An M/M/s queueing system with a simple cost structure is considered, under the assumption that the system will close in a finite time after which any remaining customers will require extra overtime service costs. We determine the optimal policy for admitting customers to the queue, as a function of the time, t, to closing and the current queue length, i. It is shown to have the form: admit if and only if f 1(t) ≦ i ≦ f 2(t). The bounds f 1(t) and f 2(t) are specified, and it is shown under what conditions f 1(t) = 0 (a control limit rule) or f 2(t) = ∞ (an inverse control limit rule).

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1972 

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.)

Article purchase

Temporarily unavailable