Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T10:41:23.178Z Has data issue: false hasContentIssue false

On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines

Published online by Cambridge University Press:  01 July 2016

Gideon Weiss*
Affiliation:
Georgia Tech
*
* Present address: Department of Statistics, The University of Haifa, Haifa 31905, Israel.

Abstract

We consider scheduling a batch of jobs with stochastic processing times on single or parallel machines, with the objective of minimizing the expected holding costs. Preemption of jobs is allowed, and the holding costs of preempted jobs may depend on the stage of completion. We provide a new proof of the optimality of a Gittins priority rule for the single machine and use the same proof to show that the Gittins priority rule is nearly optimal for parallel machines.

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 1995 

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