Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • Some problems of stochastic resource allocation

  • J. C. Gittins
  • Journal:
    Journal of Applied Probability / Volume 9 / Issue 2 / June 1972
    Published online by Cambridge University Press:
    14 July 2016, pp. 360-369
    Print publication:
    June 1972

  • Suppose that a number of jobs are to be carried out by a single processing unit orserver. The server can process any number of jobs at the same time but the time taken to finish all the jobs is the same no matter what scheduling policy is used, provided the server is never left idle. It is, however, possible to minimise the total delays to individual jobs by adopting a suitable policy. Optimal policies are derived here for the situation when the processing times are random variables. If the completion rates (analogous to hazard rates) for every job are increasing it is optimal to process the jobs in sequence. If they are decreasing the optimal policy involves simultaneous processing. These results are applied to a more general resource allocation problem arising in industrial chemical research.