Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds (Q2845031)

From MaRDI portal
Revision as of 13:03, 21 August 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
Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
scientific article

    Statements

    Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds (English)
    0 references
    0 references
    0 references
    22 August 2013
    0 references
    single machine scheduling
    0 references
    tardy jobs
    0 references
    dominance conditions
    0 references
    mixed-integer programming
    0 references

    Identifiers