The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
scientific article

    Statements

    The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (English)
    0 references
    0 references
    18 May 2012
    0 references
    scheduling
    0 references
    deteriorating
    0 references
    aging effect
    0 references
    computational complexity
    0 references
    0 references

    Identifiers