Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-17T23:14:41.723Z Has data issue: false hasContentIssue false
  • English
  • Français

A hamiltonian approach to optimal stochastic resource allocation

Published online by Cambridge University Press:  01 July 2016

P. Nash  and
J. C. Gittins
P. Nash
Affiliation:
University of Oxford
J. C. Gittins
Affiliation:
University of Cambridge
Get access Rights & Permissions [Opens in a new window]

Abstract

The problem of scheduling items for service with random service times is formulated as an optimal control problem. Pontryagin's maximum principle is used to determine the optimal schedule in certain cases.

Keywords

RESOURCE ALLOCATIONSTOCHASTIC SCHEDULINGOPTIMAL CONTROLRESEARCH PROJECT SELECTIONPONTRYAGIN MAXIMUM PRINCIPLEDYNAMIC ALLOCATION INDEX
Type
Research Article
Information
Advances in Applied Probability , Volume 9 , Issue 1 , March 1977 , pp. 55 - 68
Copyright
Copyright © Applied Probability Trust 1977 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Conway, R. W., Maxwell, W. L. and Miller, L. W. (1967) The Theory of Scheduling. Addison-Wesley, Reading, Mass. Google Scholar
[2] Cox, D. R. (1959) A renewal problem with bulk ordering of components. J. R. Statist. Soc. B 21, 180–189.Google Scholar
[3] Dreyfus, S. E. (1965) Dynamic Programming and the Calculus of Variations. Academic Press, London.Google Scholar
[4] El-Sayyad, G. M. (1967) Some Fixed Sample and Sequential Decision Procedures. , University College, Aberystwyth.Google Scholar
[5] Gait, P. A. (1972) Optimal Allocation and Control under Uncertainty. , University of Cambridge.Google Scholar
[6] Gittins, J. C. (1969) Optimal resource allocation in chemical research. Adv. Appl. Prob. 1, 238–270.CrossRefGoogle Scholar
[7] Gittins, J. C. (1972) Some problems of stochastic resource allocation. J. Appl. Prob. 9, 360–369.CrossRefGoogle Scholar
[8] Gittins, J. C. and Jones, D. M. (1974) A dynamic allocation index for the sequential design of experiments. In Progress in Statistics, ed. Gani, J. et al., North-Holland, Amsterdam, 241–266.Google Scholar
[9] Haworth, G. M. (1972) Process scheduling by output consideration. Presented at the Second European Seminar on Real-Time Programming, University of Erlangen. March 1972.Google Scholar
[10] Kamien, M. I. and Schwartz, N. L. (1971) Expenditure patterns for risky R and D projects. J. Appl. Prob. 8, 60–73.CrossRefGoogle Scholar
[11] Laska, E., Meisner, M. and Siegel, C. (1972) Optimal resource allocation. J. Appl. Prob. 9, 337–359.CrossRefGoogle Scholar
[12] Lee, E. B. and Markus, L. (1968) Foundations of Optimal Control Theory. Wiley, New York.Google Scholar
[13] Lindley, D. V. (1960) On Cox's renewal problem. Unpublished.Google Scholar
[14] Lucas, R.E. (1971) Optimal management of an R&D project. Management Sci. 17, A679–A697.CrossRefGoogle Scholar
[15] Rothkopf, M. (1966) Scheduling with random service times. Management Sci. 12, 707–713.CrossRefGoogle Scholar
[16] Schrage, L. E. (1968) A proof of the optimality of the Shortest Remaining Process Time discipline. Opns. Res. 16, 687–689.CrossRefGoogle Scholar
[17] Sevcik, K. C. (1972) The use of service-time distributions in scheduling. Technical Report CSRG-14, University of Toronto.Google Scholar