Solvable cases of the flow-shop problem without interruptions in job processing (Q3670908)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Solvable cases of the flow-shop problem without interruptions in job processing
scientific article

    Statements

    Solvable cases of the flow-shop problem without interruptions in job processing (English)
    0 references
    0 references
    1983
    0 references
    flow-shop problem without interruptions
    0 references
    Gilmore-Gomory's algorithm
    0 references
    lower completion time bound
    0 references
    minimal completion time
    0 references

    Identifiers