A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279)

From MaRDI portal
Revision as of 14:09, 24 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
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
scientific article

    Statements

    A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (English)
    0 references
    0 references
    16 May 2006
    0 references
    0 references
    Approximation algorithms
    0 references
    Flow shop scheduling
    0 references
    Availability constraints
    0 references
    0 references