Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449)

From MaRDI portal
Revision as of 03:59, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
scientific article

    Statements

    Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (English)
    0 references
    0 references
    0 references
    24 February 2009
    0 references
    scheduling
    0 references
    flow shop
    0 references
    due dates
    0 references
    greedy algorithm
    0 references

    Identifiers