Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818)

From MaRDI portal
Revision as of 21:00, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
scientific article

    Statements

    Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    scheduling
    0 references
    single machine problems
    0 references
    maximization problems
    0 references
    total tardiness
    0 references
    polynomial algorithm
    0 references
    0 references

    Identifiers