Applying a New Device in the Optimization of Exponential Queuing Systems
暂无分享,去创建一个
[1] A. F. Veinott. ON FINDING OPTIMAL POLICIES IN DISCRETE DYNAMIC PROGRAMMING WITH NO DISCOUNTING , 1966 .
[2] David W. Low,et al. Optimal Dynamic Pricing Policies for an M/M/s Queue , 1974, Oper. Res..
[3] Daniel P. Heyman,et al. Optimal Operating Policies for M/G/1 Queuing Systems , 1968, Oper. Res..
[4] Matthew J. Sobel,et al. Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs , 1969, Oper. Res..
[5] A. F. Veinott. Discrete Dynamic Programming with Sensitive Discount Optimality Criteria , 1969 .
[6] S. Lippman. Semi-Markov Decision Processes with Unbounded Rewards , 1973 .
[7] Ronald A. Howard,et al. Dynamic Programming and Markov Processes , 1960 .
[8] Joseph D. Blackburn. Optimal Control of a Single-Server Queue with Balking and Reneging , 1972 .
[9] S. Lippman. On Dynamic Programming with Unbounded Rewards , 1975 .
[10] T. B. Crabill. Optimal Control of a Service Facility with Variable Exponential Service Times and Constant Arrival Rate , 1972 .
[11] M. J. Magazine,et al. Optimal control of multi‐channel service systems , 1971 .
[12] Sheldon M. Ross,et al. The Streetwalker’s Dilemma: A Job Shop Model , 1971 .
[13] E. Denardo. Markov Renewal Programs with Small Interest Rates , 1971 .
[14] P. Schweitzer. Iterative solution of the functional equations of undiscounted Markov renewal programming , 1971 .
[15] Colin E. Bell,et al. Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server , 1971, Oper. Res..
[16] D. Blackwell. Discrete Dynamic Programming , 1962 .
[17] Mark R. Lembersky. On Maximal Rewards and $|varepsilon$-Optimal Policies in Continuous Time Markov Decision Chains , 1974 .
[18] B. L. Miller,et al. Discrete Dynamic Programming with a Small Interest Rate , 1969 .
[19] M. Cramer. Optimal Customer Selection in Exponential Queues. , 1971 .