Minimizing the total completion time in a single-machine scheduling problem with a learning effect (Q552439)

From MaRDI portal
Revision as of 07:18, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimizing the total completion time in a single-machine scheduling problem with a learning effect
scientific article

    Statements

    Minimizing the total completion time in a single-machine scheduling problem with a learning effect (English)
    0 references
    0 references
    0 references
    21 July 2011
    0 references
    single-machine
    0 references
    time-dependent
    0 references
    learning effect
    0 references
    total completion time
    0 references
    SPT rule
    0 references

    Identifiers