Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602)

From MaRDI portal
Revision as of 00:19, 4 June 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
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
scientific article

    Statements

    Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2003
    0 references
    0 references
    permutation flow shop
    0 references
    makespan
    0 references
    lateness
    0 references
    release times
    0 references
    0 references