A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints (Q2197158)
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 procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints |
scientific article; zbMATH DE number 7241749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints |
scientific article; zbMATH DE number 7241749 |
Statements
A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints (English)
0 references
28 August 2020
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 references
0 references
0 references
0.9361147284507751
0 references
0.9123103022575378
0 references
0.8369036912918091
0 references
0.8300809264183044
0 references
0.8256876468658447
0 references
