Minimizing flow time on a constant number of machines with preemption (Q1779706)

From MaRDI portal
Revision as of 05:39, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Minimizing flow time on a constant number of machines with preemption
scientific article

    Statements

    Minimizing flow time on a constant number of machines with preemption (English)
    0 references
    0 references
    1 June 2005
    0 references
    Flow time
    0 references
    Approximation schemes
    0 references
    Multiple machines
    0 references
    Preemption
    0 references
    Scheduling
    0 references

    Identifiers