A novel branch-and-bound algorithm for the chance-constrained resource-constrained project scheduling problem
Year of publication: |
2019
|
---|---|
Authors: | Davari, Morteza ; Demeulemeester, Erik |
Subject: | branch and bound | chance constraints | project scheduling | resource constraints | uncertainty | Scheduling-Verfahren | Scheduling problem | Projektmanagement | Project management | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Engpass | Bottleneck |
-
Solving the RCPSP efficiently at modest memory requirements
Sprecher, Arno, (1996)
-
Watermeyer, Kai, (2023)
-
Tian, Baofeng, (2024)
- More ...
-
Davari, Morteza, (2017)
-
A Novel Branch-and-Bound Algorithm for the Chance-Constrained RCPSP
Davari, Morteza, (2016)
-
Exact algorithms for singlemachine scheduling with time windows and precedence constraints
Davari, Morteza, (2013)
- More ...