Time complexity and linear-time approximation of the ancient two-machine flow shop (Q1268836)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Time complexity and linear-time approximation of the ancient two-machine flow shop
scientific article

    Statements

    Time complexity and linear-time approximation of the ancient two-machine flow shop (English)
    0 references
    0 references
    0 references
    1 November 1998
    0 references
    0 references
    flow shop
    0 references
    no wait in progress
    0 references
    computational complexity
    0 references
    algebraic computation tree
    0 references
    lower bounds
    0 references
    makespan minimization
    0 references
    two-machine flow shop
    0 references
    approximation algorithms
    0 references
    0 references