A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective (Q6568412)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective |
scientific article; zbMATH DE number 7877708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective |
scientific article; zbMATH DE number 7877708 |
Statements
A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective (English)
0 references
8 July 2024
0 references
project scheduling
0 references
optimization model
0 references
branch-and-bound algorithm
0 references
robustness
0 references
resource constraint
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
