Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (Q3423261)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
scientific article

    Statements

    Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2007
    0 references
    open shop
    0 references
    machine availability
    0 references
    approximation scheme
    0 references

    Identifiers