An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (Q972619)

From MaRDI portal
Revision as of 21:03, 2 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
An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
scientific article

    Statements

    An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 2010
    0 references
    0 references
    flow shop
    0 references
    worst case analysis
    0 references
    0 references