论文信息 - Optimal policies for queuing systems with periodic review

Optimal policies for queuing systems with periodic review

Abstract : The general problem of finding optimal policies for operating queuing systems is investigated in order to determine when to open or close servers so as to minimize cost. The queue size is observed at equally spaced intervals of time and the structure of the optimal policy is determined. The main restriction made, at first, is to limit the model to a single server system. Justification for a form of an optimal policy is given. Then the proofs that this policy is in fact optimal for the finite horizon, and averaging cost criterion are given. Also, conditions for determining that the server should never be closed with customers in queue are presented. The problem is then generalized to allow for a fixed number of servers. (Author)

Michael Jay Magazine | M. Magazine

[1] M. Yadin,et al. Queueing Systems with a Removable Service Station , 1963 .

[2] R. Bellman. Dynamic programming. , 1957, Science.

[3] J. Moder,et al. Queuing With Fixed and Variable Channels , 1962 .

[4] Matthew J. Sobel,et al. Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs , 1969, Oper. Res..

[5] Shang Zhi,et al. A proof of the queueing formula: L=λW , 2001 .

[6] D. Blackwell. Discounted Dynamic Programming , 1965 .

[7] D. Heyman. OPTIMAL OPERATING POLICIES FOR STOCHASTIC SERVICE SYSTEMS , 1966 .

[8] Willard I. Zangwill,et al. The Piecewise Concave Function , 1967 .

[9] Leslie C. Edie,et al. Traffic Delays at Toll Booths , 1954, Oper. Res..

[10] Walter L. Smith,et al. ON THE SUPERPOSITION OF RENEWAL PROCESSES , 1954 .

[11] W. Jewell. Markov-Renewal Programming. II: Infinite Return Models, Example , 1963 .

[12] N. U. Prabhu,et al. Queues and Inventories , 1966 .

[13] A. F. Veinott. ON FINDING OPTIMAL POLICIES IN DISCRETE DYNAMIC PROGRAMMING WITH NO DISCOUNTING , 1966 .