A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253)

From MaRDI portal
Revision as of 18:17, 3 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
scientific article

    Statements

    A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (English)
    0 references
    0 references
    0 references
    16 January 2012
    0 references
    batch scheduling
    0 references
    flow shop
    0 references
    polynomial-time algorithm
    0 references

    Identifiers