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
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00756-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4298429526 / rank | |||
Normal rank | |||
Latest revision as of 08:43, 30 July 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
0 references
