Stochastic scheduling problems I — General strategies |
| |
Authors: | R. H. Möhring F. J. Radermacher G. Weiss |
| |
Affiliation: | (1) Fachbereich Informatik, Hochschule Hildesheim, D-3200 Hildesheim;(2) Lehrstuhl für Informatik und Operations Research, University of Passau, D-8390 Passau;(3) Department of Statistics, Tel-Aviv University, Ramat-Aviv, Israel |
| |
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. |
| |
Keywords: | 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 |
本文献已被 SpringerLink 等数据库收录! |