A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114)

From MaRDI portal
Revision as of 21:56, 7 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
A faster fully polynomial approximation scheme for the single-machine total tardiness problem
scientific article

    Statements

    A faster fully polynomial approximation scheme for the single-machine total tardiness problem (English)
    0 references
    2 December 2008
    0 references
    single-machine sequencing
    0 references
    total tardiness
    0 references
    fully polynomial approximation
    0 references

    Identifiers