Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6018313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound |
scientific article; zbMATH DE number 6018313 |
Statements
Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (English)
0 references
23 March 2012
0 references
RCPSP
0 references
feeding precedence relations
0 references
lower bound
0 references
Lagrangian relaxation
0 references
0 references
0.8799141049385071
0 references
0.842080295085907
0 references
0.8336254358291626
0 references
0.8319684267044067
0 references
