A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786)

From MaRDI portal
Revision as of 02:00, 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
A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
scientific article

    Statements

    A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (English)
    0 references
    0 references
    15 October 2009
    0 references
    0 references
    flow shop scheduling
    0 references
    availability constraint
    0 references
    approximation algorithms
    0 references
    error bound
    0 references
    0 references