An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265)

From MaRDI portal
Revision as of 19:58, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
scientific article

    Statements

    An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (English)
    0 references
    0 references
    21 July 2009
    0 references
    0 references
    approximation algorithms
    0 references
    flow shop scheduling
    0 references
    worst-case analysis
    0 references