An open shop scheduling problem with a non-bottleneck machine (Q1371949)

From MaRDI portal
Revision as of 02:19, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
An open shop scheduling problem with a non-bottleneck machine
scientific article

    Statements

    An open shop scheduling problem with a non-bottleneck machine (English)
    0 references
    6 November 1997
    0 references
    fully polynomial approximation scheme
    0 references
    worst-case analysis
    0 references
    approximation
    0 references
    two-machine non-preemptive open shop
    0 references
    makespan
    0 references
    maximum completion time
    0 references

    Identifiers