Stochastic scheduling problems II-set strategies-

DOI10.1007/BF01918198zbMath0568.90043OpenAlexW1989077188MaRDI QIDQ3685553

Rolf H. Möhring, F. J. Radermacher, George H. Weiss

Publication date: 1985

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01918198

zbMATH Keywords

flowtimemakespanstochastic schedulingcomputer systemsstability behaviournetworks of queuesshift propertyadditive cost criterionanalytic behaviour of strategiesES strategylist-scheduling strategiesMES strategypriority-type strategiesregular measure of performanceset strategies

Mathematics Subject Classification ID

Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)

Related Items

A classification of predictive-reactive project scheduling procedures, When it is worthwhile to work with the stochastic RCPSP?, Advanced DSS for scheduling: Software engineering aspects and the role of eigenmodels, A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept, New trends in machine scheduling, Stochastic scheduling problems I — General strategies, Scheduling of project networks, When greediness fails: examples from stochastic scheduling., Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling, Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem, Project scheduling under uncertainty: survey and research potentials, Proactive policies for the stochastic resource-constrained project scheduling problem, Efficient priority rules for the stochastic resource-constrained project scheduling problem, The proactive and reactive resource-constrained project scheduling problem, On index policies for stochastic minsum scheduling, Some concepts of stability analysis in combinatorial optimization, Resource-constrained project scheduling: Notation, classification, models, and methods, Worst‐case allocation algorithms in a complex of operations with interval parameters, A Tight 2-Approximation for Preemptive Stochastic Scheduling, New directions in scheduling theory

Cites Work

• Stochastic optimal control. The discrete time case
• Stochastic scheduling problems I — General strategies
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• Algorithmic approaches to preselective strategies for stochastic scheduling problems
• Negative Dynamic Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item