Idle Time in a Parallel Channel Queue.
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback5 pages | $20.00 | $16.00 20% Web Discount |
Prepared for submission to [Operations] [Research]. The idle time ratio of a queueing system (i.e., the ratio of idle to total time summed over all channels) is a measure of the efficiency of the system. In trying to improve the operations of a queueing system, the question naturally arises as to the possibility of decreasing the idle time by simply choosing a state-dependent arrival discipline. This paper presents a negative answer to this question for a simple queue. 5 pp. Ref.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.