A CTMDP-Based Exact Method for RCPSP with Uncertain Activity Durations and Rework

DOI10.1007/978-3-319-89920-6_74zbMath1397.90195OpenAlexW2804791424MaRDI QIDQ4685811

No author found.

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_74

zbMATH Keywords

decompositionstochastic RCPSPCTMDPrandom rework

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling of design projects with uncertain number of iterations
• Project scheduling under uncertainty: survey and research potentials
• Scheduling Markovian PERT networks to maximize the net present value
• Minimizing the expected makespan of a project with stochastic activity durations under resource constraints
• Unnamed Item

This page was built for publication: A CTMDP-Based Exact Method for RCPSP with Uncertain Activity Durations and Rework