Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (Q2044553)

From MaRDI portal
Revision as of 23:34, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
scientific article

    Statements

    Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 August 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lot streaming
    0 references
    setup times
    0 references
    flow shop
    0 references
    total flow time
    0 references
    Lagrangian relaxation
    0 references
    dynamic programming
    0 references
    0 references