Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123)

From MaRDI portal
Revision as of 10:37, 28 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
Finding the Pareto-optima for the total and maximum tardiness single machine problem
scientific article

    Statements

    Finding the Pareto-optima for the total and maximum tardiness single machine problem (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    total and maximum tardiness
    0 references
    \(\varepsilon\)-constraint approach
    0 references
    Pareto-optima
    0 references
    branch-and-bound algorithm
    0 references