Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988)

From MaRDI portal
Revision as of 20:28, 4 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127646641, #quickstatements; #temporary_batch_1722799621482)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
scientific article

    Statements

    Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (English)
    0 references
    0 references
    0 references
    0 references
    7 August 1997
    0 references
    sequencing
    0 references
    time-cost trade-offs
    0 references
    resource allocation
    0 references
    single-machine scheduling
    0 references
    NP-hardness
    0 references
    pseudo-polynomial-time dynamic programming algorithm
    0 references

    Identifiers