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

From MaRDI portal
Revision as of 15:47, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/scheduling/BruckerS11a, #quickstatements; #temporary_batch_1731508824982)
(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

    Identifiers