Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs (Q1960313)

From MaRDI portal
Revision as of 20:08, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
scientific article

    Statements

    Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2000
    0 references
    branch and bound algorithm
    0 references
    single-machine scheduling
    0 references
    maximum tardiness
    0 references
    tardy jobs
    0 references

    Identifiers