A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20388 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033102973 / rank
 
Normal rank

Revision as of 22:27, 19 March 2024

scientific article
Language Label Description Also known as
English
A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
scientific article

    Statements

    A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    acyclic networks
    0 references
    project scheduling
    0 references
    time lags
    0 references
    0 references