An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (Q4390594)

From MaRDI portal
Revision as of 09:13, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1156570
Language Label Description Also known as
English
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
scientific article; zbMATH DE number 1156570

    Statements

    0 references
    0 references
    0 references
    26 May 1998
    0 references
    makespan minimization
    0 references
    flow shop
    0 references
    two machines
    0 references
    exact branch-and-bound
    0 references
    An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (English)
    0 references

    Identifiers