Busy Period Control of Queues Based on Waiting Times at Arrivals

Leonard Shaw
Additional contact information
Leonard Shaw: Polytechnic Institute of New York, Brooklyn, New York

Operations Research, 1976, vol. 24, issue 3, 543-563

Abstract: System maintenance and vehicular traffic control problems have motivated the queue control systems studied here. This article presents results for optimal assignment of servers or rejection of customers, on the basis of arriving customers' waiting times w n , when the objective function is the mean of a control penalty plus a variable such as busy period duration, number served in a busy period, or total delay to all customers in a busy period. Under the first two criteria, we generalize previous results for M / M /1 queues to similar results for the M / G /1 case. We show that the optimal customer rejection (vehicle diversion) to minimize total delay to accepted and rejected (detoured) customers is of the control-limit form for the M / G /1 case and give an explicit expression for the optimal threshold for the M / M /1 case.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.3.543 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:24:y:1976:i:3:p:543-563

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().