Algorithmic approaches to preselective strategies for stochastic scheduling problems

DOI10.1002/NET.3230130103zbMATH Open0504.90040DBLPjournals/networks/LgelmundR83OpenAlexW1967618612WikidataQ89365821 ScholiaQ89365821MaRDI QIDQ4740323FDOQ4740323

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

zbMATH Keywords

implicit enumerationbranch-and-boundstochastic schedulingstability behaviorMES strategiess-induced strategies

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Stochastic optimal control. The discrete time case
• Title not available (Why is that?)

Cited In (19)

• A compact reformulation of the two-stage robust resource-constrained project scheduling problem
• Stochastic scheduling problems I — General strategies
• Robust optimization models for project scheduling with resource availability cost
• 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
• Stochastic scheduling problems II-set strategies-
• On the complexity of scheduling unit-time jobs with or-precedence constraints
• Resource allocation by means of project networks: Dominance results
• Resource allocation by means of project networks: Complexity results

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)