Time complexity of single machine scheduling with stochastic precedence constraints
From MaRDI portal
Publication:4009793
DOI10.1007/BF01415888zbMath0761.90056OpenAlexW2094405740MaRDI QIDQ4009793
No author found.
Publication date: 27 September 1992
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01415888
Abstract computational complexity for mathematical programming problems (90C60) Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Stochastic project networks. Temporal analysis, scheduling and cost minimization
- GERT networks and the time-oriented evaluation of projects
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
- Complexity of Scheduling under Precedence Constraints
- Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Time complexity of single machine scheduling with stochastic precedence constraints