A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (Q398896)

From MaRDI portal
Revision as of 22:36, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
scientific article

    Statements

    A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    two-machine flow-shop
    0 references
    serial batching
    0 references
    bounded batch size
    0 references
    makespan
    0 references
    batching cost
    0 references
    0 references