A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043)
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 5827900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time |
scientific article; zbMATH DE number 5827900 |
Statements
A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (English)
0 references
20 December 2010
0 references
acyclic networks
0 references
project scheduling
0 references
time lags
0 references
0 references
0.7969745397567749
0 references
0.7967817783355713
0 references
0.7865774631500244
0 references
0.7790604829788208
0 references
