An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2020.03.079 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3016605981 / rank | |||
Normal rank | |||
Revision as of 03:38, 20 March 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
