An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CHIP / rank | |||
Normal rank | |||
Revision as of 06:58, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem |
scientific article |
Statements
An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (English)
0 references
27 May 2020
0 references
scheduling
0 references
cumulative resource
0 references
energetic reasoning
0 references
adjustment
0 references
