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
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
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 | |||
Property / cites work | |||
Property / cites work: Q3468865 / 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: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling of project networks / rank | |||
Normal rank |
Latest revision as of 14:35, 3 July 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
20 December 2010
0 references
acyclic networks
0 references
project scheduling
0 references
time lags
0 references
0 references