A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations (Q709101)
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 new lower bound for the resource-constrained project scheduling problem with generalized precedence relations |
scientific article; zbMATH DE number 5800785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations |
scientific article; zbMATH DE number 5800785 |
Statements
A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations (English)
0 references
15 October 2010
0 references
generalized precedence relationships
0 references
lower bound
0 references
project scheduling
0 references
0 references
0 references
0 references
0.8792575001716614
0 references
0.872434139251709
0 references
0.8525028824806213
0 references
