Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints (Q2439528)

From MaRDI portal
Revision as of 14:24, 4 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
Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints
scientific article

    Statements

    Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints (English)
    0 references
    0 references
    14 March 2014
    0 references
    scheduling
    0 references
    single machine
    0 references
    \(k\)-partite precedence
    0 references
    variable job processing times
    0 references
    maximum cost
    0 references
    polynomial algorithm
    0 references

    Identifiers