A heuristic algorithm for two-machine re-entrant shop scheduling (Q1290158)

From MaRDI portal
Revision as of 11:44, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A heuristic algorithm for two-machine re-entrant shop scheduling
scientific article

    Statements

    A heuristic algorithm for two-machine re-entrant shop scheduling (English)
    0 references
    10 June 1999
    0 references
    0 references
    two-machine re-entrant shop
    0 references
    maximum completion time
    0 references
    heuristic
    0 references
    worst-case performance ratio
    0 references