Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176)

From MaRDI portal
Revision as of 18:43, 3 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
Minimizing the makespan in nonpreemptive parallel machine scheduling problem
scientific article

    Statements

    Minimizing the makespan in nonpreemptive parallel machine scheduling problem (English)
    0 references
    2 January 2012
    0 references
    optimization
    0 references
    scheduling
    0 references
    approximation algorithm
    0 references

    Identifiers