Scheduling, Queues and Dynamic Allocation Indices
暂无分享,去创建一个
P. Nash | John Gittins | J. Gittins | P. Nash
[1] Harold Greenberg. An algorithm for the computation of knapsack functions , 1969 .
[2] Ronald A. Howard,et al. Dynamic Programming and Markov Processes , 1960 .
[3] M. A. Aczel. Letter to the Editor—The Effect of Introducing Priorities , 1960 .
[4] J. Gani,et al. Progress in statistics , 1975 .
[5] N. K. Jaiswal,et al. Priority queues , 1968 .
[6] J. Gittins,et al. A hamiltonian approach to optimal stochastic resource allocation , 1977, Advances in Applied Probability.
[7] Arie Hordijk,et al. Dynamic programming and Markov potential theory , 1974 .
[8] R. Bellman. A PROBLEM IN THE SEQUENTIAL DESIGN OF EXPERIMENTS , 1954 .
[9] R. Bellman. Dynamic programming. , 1957, Science.
[10] Robert Schlaifer,et al. Analysis of decisions under uncertainty , 1969 .
[11] K. C. Sevcik,et al. USE OF SERVICE TIME DISTRIBUTIONS IN SCHEDULING. , 1971 .
[12] L. J. Savage,et al. The Foundations of Statistics , 1955 .
[13] J. Neumann,et al. Theory of Games and Economic Behavior. , 1945 .
[14] J. Gittins. OPTIMAL RESOURCE ALLOCATION IN CHEMICAL RESEARCH , 1969 .
[15] Linus Schrage,et al. Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..
[16] S. Yakowitz. Mathematics of adaptive control processes , 1969 .
[17] Speculative chemical research—how many eggs in a basket? , 1973 .
[18] P. Naor,et al. On discretionary priority queueing , 1964 .