Maximizing set function formulation of two scheduling problems (Q4015963)

From MaRDI portal
Revision as of 20:00, 23 October 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
Maximizing set function formulation of two scheduling problems
scientific article

    Statements

    Maximizing set function formulation of two scheduling problems (English)
    0 references
    0 references
    12 November 1992
    0 references
    single machine
    0 references
    total weighted earliness and tardiness
    0 references
    parallel identical processors
    0 references
    weighted mean flow time
    0 references
    submodular set function
    0 references
    heuristic algorithm
    0 references

    Identifiers