Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs

Matthew J. Sobel
Additional contact information
Matthew J. Sobel: Yale University, New Haven, Connecticut

Operations Research, 1969, vol. 17, issue 1, 145-162

Abstract: This paper examines pure stationary policies for starting and stopping service in a single-server queue with respect to the state space consisting of queue length and whether or not the service facility is operating. Almost any such policy is shown to be equivalent to one that depends on two parameters. For a wide class of cost functions, the “almost any” is shown to be without loss of optimality in the sense of average cost per unit time over an infinite horizon. The results are largely distribution-free and are obtained with random-walk arguments. They apply also to certain repair problems and to production smoothing problems in which demand is a renewal process and goods are made sequentially.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.1.145 (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:17:y:1969:i:1:p:145-162

Access Statistics for this article

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