Algorithmic approaches to preselective strategies for stochastic scheduling problems
From MaRDI portal
Publication:4740323
Cites work
Cited in
(19)- A compact reformulation of the two-stage robust resource-constrained project scheduling problem
- Robust optimization models for project scheduling with resource availability cost
- Stochastic scheduling problems I — General strategies
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
- A classification of predictive-reactive project scheduling procedures
- On the generation of circuits and minimal forbidden sets
- Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
- A heuristic approach for resource constrained project scheduling with uncertain activity durations
- A min-flow algorithm for minimal critical set detection in resource constrained project scheduling
- Project scheduling under uncertainty: survey and research potentials
- Resource-constrained project scheduling: Notation, classification, models, and methods
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- Scheduling of project networks
- A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- Resource allocation by means of project networks: dominance results
- Resource allocation by means of project networks: complexity results
- On the complexity of scheduling unit-time jobs with or-precedence constraints
- Stochastic scheduling problems II-set strategies-
This page was built for publication: Algorithmic approaches to preselective strategies for stochastic scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740323)
