Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. (Q1417510)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. |
scientific article; zbMATH DE number 2021187
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. |
scientific article; zbMATH DE number 2021187 |
Statements
Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. (English)
0 references
5 January 2004
0 references
Scheduling
0 references
Resource constraint project scheduling
0 references
Constraint programming
0 references
Compulsory part
0 references
Core time
0 references
0 references
