Minimization of mean flow time for some discrete-continuous scheduling problems (Q1368686)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Minimization of mean flow time for some discrete-continuous scheduling problems
scientific article

    Statements

    Minimization of mean flow time for some discrete-continuous scheduling problems (English)
    0 references
    0 references
    0 references
    29 September 1997
    0 references
    independent, nonpreemptable jobs
    0 references
    parallel machines
    0 references
    continuously divisible, renewable resources
    0 references
    mean flow time
    0 references

    Identifiers