Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. (Q1417510)

From MaRDI portal
Revision as of 08:43, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.
scientific article

    Statements

    Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. (English)
    0 references
    0 references
    0 references
    0 references
    5 January 2004
    0 references
    Scheduling
    0 references
    Resource constraint project scheduling
    0 references
    Constraint programming
    0 references
    Compulsory part
    0 references
    Core time
    0 references

    Identifiers