An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136)

From MaRDI portal
Revision as of 03:38, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    0 references
    0 references
    27 May 2020
    0 references
    0 references
    scheduling
    0 references
    cumulative resource
    0 references
    energetic reasoning
    0 references
    adjustment
    0 references
    0 references