Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. (Q1417510): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:18, 31 January 2024
scientific article
| 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 |
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
