Stochastic scheduling problems I — General strategies

DOI10.1007/BF01919323zbMath0553.90058OpenAlexW1984302977MaRDI QIDQ3216419

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

Publication date: 1984

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

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

zbMATH Keywords

stochastic dynamic optimizationcontinuous strategiesexistence of optimal strategiesLebesgue densityjoint duration distributionslower semicontinuous performance measuresmonotonicity behaviournon-preemptive stochastic scheduling

Mathematics Subject Classification ID

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

Related Items (37)

New strategies for stochastic resource-constrained project scheduling ⋮ A classification of predictive-reactive project scheduling procedures ⋮ When it is worthwhile to work with the stochastic RCPSP? ⋮ Unnamed Item ⋮ Advanced DSS for scheduling: Software engineering aspects and the role of eigenmodels ⋮ Scheduling under linear constraints ⋮ A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept ⋮ Unrelated Machine Scheduling with Stochastic Processing Times ⋮ New trends in machine scheduling ⋮ Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines ⋮ The expected asymptotical ratio for preemptive stochastic online problem ⋮ Fast minimum float computation in activity networks under interval uncertainty ⋮ Improved bounds for stochastic extensible bin packing under distributional assumptions ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Scheduling of project networks ⋮ When greediness fails: examples from stochastic scheduling. ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ An adversarial model for scheduling with testing ⋮ Online stochastic optimization under time constraints ⋮ Analysis of Smith's rule in stochastic machine scheduling ⋮ Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem ⋮ Coping with Incomplete Information in Scheduling — Stochastic and Online Models ⋮ Approximation algorithms for scheduling problems with a modified total weighted tardiness objective ⋮ Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems ⋮ New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing ⋮ 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 ⋮ Related machine scheduling with machine speeds satisfying linear constraints ⋮ On index policies for stochastic minsum scheduling ⋮ Some concepts of stability analysis in combinatorial optimization ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling ⋮ New directions in scheduling theory ⋮ Stochastic Online Scheduling Revisited ⋮ Stochastic scheduling problems II-set strategies-

Cites Work

• Stochastic optimal control. The discrete time case
• Stochastic inequalities on partially ordered spaces
• Convex majorization with an application to the length of critical paths
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• Stochastic scheduling problems II-set strategies-
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Bounding distributions for a stochastic pert network
• [https://portal.mardi4nfdi.de/wiki/Publication:4148538 Mesures marginales et th�or�me de Ford-Fulkerson]
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• Algorithmic approaches to preselective strategies for stochastic scheduling problems
• The Existence of Probability Measures with Given Marginals
• Negative Dynamic Programming
• Association of Random Variables, with Applications
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stochastic scheduling problems I — General strategies