A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints (Q2152012)
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 partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints |
scientific article; zbMATH DE number 7553812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints |
scientific article; zbMATH DE number 7553812 |
Statements
A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints (English)
0 references
6 July 2022
0 references
project scheduling
0 references
branch and bound
0 references
resource-constrained project scheduling
0 references
partially renewable resources
0 references
minimum and maximum time lags
0 references
0 references
0 references
0 references
0.9742583
0 references
0.9558809
0 references
0.8873796
0 references
0.8865859
0 references
0.8854438
0 references
0.88175297
0 references
0.8814051
0 references
0.87177837
0 references
