Zeitschrift für Operations Research

, Volume 28, Issue 7, pp 193–260

Stochastic scheduling problems I — General strategies

  • R. H. Möhring
  • F. J. Radermacher
  • G. Weiss
Article

DOI: 10.1007/BF01919323

Cite this article as:
Möhring, R.H., Radermacher, F.J. & Weiss, G. Zeitschrift für Operations Research (1984) 28: 193. doi:10.1007/BF01919323
  • 317 Downloads

Abstract

The paper contains an introduction to recent developments in the theory of non-preemptive stochastic scheduling problems. The topics covered are: arbitrary joint distributions of activity durations, arbitrary regular measures of performance and arbitrary precedence and resource constraints. The possible instability of the problem is demonstrated and hints are given on stable classes of strategies available, including the combinatorial vs. analytical characterization of such classes. Given this background, the main emphasis of the paper is on the monotonicity behaviour of the model and on the existence of optimal strategies. Existing results are presented and generalized, in particular w.r.t. the cases of lower semicontinuous performance measures or joint duration distributions having a Lebesgue density.

Key words

Analytic behaviour of strategies continuous strategies ES strategies MES strategies machine idleness monotonicity behaviour optimal strategies preselectivity regular measure of performance scheduling problems stability stochastic dynamic optimization stochastically ordered distributions stochastic scheduling 

Copyright information

© Physica-Verlag 1984

Authors and Affiliations

  • R. H. Möhring
    • 1
  • F. J. Radermacher
    • 2
  • G. Weiss
    • 3
  1. 1.Fachbereich InformatikHochschule HildesheimHildesheim
  2. 2.Lehrstuhl für Informatik und Operations ResearchUniversity of PassauPassau
  3. 3.Department of StatisticsTel-Aviv UniversityRamat-AvivIsrael

Personalised recommendations