An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:15, 2 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
