Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T00:52:13.850Z Has data issue: false hasContentIssue false

Single-machine stochastic scheduling with dependent processing times

Published online by Cambridge University Press:  01 July 2016

K. D. Glazebrook*
Affiliation:
University of Newcastle upon Tyne
Lyn R. Whitaker*
Affiliation:
Naval Postgraduate School
*
∗Postal address: Department of Mathematics and Statistics, University of Newcastle upon Tyne, Newcastle upon Tyne, NE1 7RU, UK.
∗∗Postal address: Department of Operations Research, Naval Postgraduate School, Monterey, California 93943, USA.

Abstract

A single machine is available to process a collection of stochastic jobs preemptively. Rewards are received at job completions. We seek policies for machine allocation which maximize the total reward. Application areas point to the need to study such models for resource allocation when job processing requirements are dependent. To this end, models are developed in which the nature of such dependence is derived from various notions of positive and negative dependence in common usage in reliability. Optimal policies for resource allocation of simple structure are obtained for a variety of such models.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1992 

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.)

Article purchase

Temporarily unavailable