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

From MaRDI portal
Revision as of 05:58, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
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
    scheduling
    0 references
    cumulative resource
    0 references
    energetic reasoning
    0 references
    adjustment
    0 references

    Identifiers