Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems (Q721682)
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: Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems |
scientific article; zbMATH DE number 6908675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems |
scientific article; zbMATH DE number 6908675 |
Statements
Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems (English)
0 references
19 July 2018
0 references
project management
0 references
resource-constrained scheduling
0 references
bound
0 references
branch \& bound
0 references
integer programming
0 references
net present value
0 references
0 references
0 references
0 references
0 references
