A theoretical framework for instance complexity of the resource-constrained project scheduling problem
Year of publication: |
2022
|
---|---|
Authors: | Van Eynde, Rob ; Vanhoucke, Mario |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 47.2022, 4, p. 3156-3183
|
Subject: | counting problems | instance complexity | partial orders | resource-constrained project scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Projektmanagement | Project management | Engpass | Bottleneck | Komplexitätsmanagement | Complexity management |
-
Reducing the feasible solution space of resource-constrained project instances
Vanhoucke, Mario, (2024)
-
Peykani, Pejman, (2023)
-
Solving resource-constrained project scheduling problem with evolutionary programming
Sebt, M. H., (2013)
- More ...
-
On the complexity of efficient multi-skilled team composition
Snauwaert, Jakob, (2023)
-
New summary measures and datasets for the multi-project scheduling problem
Van Eynde, Rob, (2022)
-
A reduction tree approach for the discrete time/cost trade-off problem
Van Eynde, Rob, (2022)
- More ...