Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling. A research handbook. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling with time windows. From theory to applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3426431 / rank
 
Normal rank

Latest revision as of 01:16, 5 July 2024

scientific article
Language Label Description Also known as
English
Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
scientific article

    Statements

    Identifiers