Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-24T12:26:25.126Z Has data issue: false hasContentIssue false
  • English
  • Français

Necessary optimality conditions for priority policies in stochastic weighted flowtime scheduling problems

Published online by Cambridge University Press:  01 July 2016

Thomas Kämpke
Thomas Kämpke*
Affiliation:
Universität Passau
*
∗Postal address: Lehrstuhl für Informatik und OR, Universität Passau, Innstrasse 27, 8390 Passau, West Germany.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Conditions implied by the optimality of static priority policies in a special class of stochastic scheduling problems will be derived.

Keywords

STOCHASTIC SCHEDULINGSTATIC PRIORITY POLICY
Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 19 , Issue 3 , September 1987 , pp. 749 - 750
Copyright
Copyright © Applied Probability Trust 1987 

References

Conway, R. W., Maxwell, W. L. and Miller, L. W. (1967) Theory of Scheduling. Addison-Wesley, Reading.Google Scholar
Kämpke, T. (1987) On the optimality of static priority policies in stochastic scheduling on parallel machines. J. Appl. Prob. 24, 430–448.CrossRefGoogle Scholar
Weber, R. R. (1986) Stochastic scheduling on parallel processors and minimization of concave functions of completion times. Preprint.Google Scholar
Weiss, G. and Pinedo, M. (1980) Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Prob. 17, 187–202.CrossRefGoogle Scholar