Algorithmic approaches to preselective strategies for stochastic scheduling problems
From MaRDI portal
Publication:4740323
DOI10.1002/net.3230130103zbMath0504.90040OpenAlexW1967618612WikidataQ89365821 ScholiaQ89365821MaRDI QIDQ4740323
F. J. Radermacher, G. Igelmund
Publication date: 1983
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230130103
branch-and-boundstochastic schedulingimplicit enumerationstability behaviorMES strategiess-induced strategies
Related Items
A classification of predictive-reactive project scheduling procedures, A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations, Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming, A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept, A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds, Robust optimization models for project scheduling with resource availability cost, Stochastic scheduling problems I — General strategies, A compact reformulation of the two-stage robust resource-constrained project scheduling problem, A Boolean satisfiability approach to the resource-constrained project scheduling problem, A heuristic approach for resource constrained project scheduling with uncertain activity durations, Scheduling of project networks, A min-flow algorithm for minimal critical set detection in resource constrained project scheduling, On the generation of circuits and minimal forbidden sets, Project scheduling under uncertainty: survey and research potentials, Resource-constrained project scheduling: Notation, classification, models, and methods, Resource allocation by means of project networks: Dominance results, Resource allocation by means of project networks: Complexity results, Stochastic scheduling problems II-set strategies-, On the complexity of scheduling unit-time jobs with or-precedence constraints
Cites Work
