Unbounded parallel-batching scheduling with two competitive agents (Q2434303)

From MaRDI portal
Revision as of 04:22, 13 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q326476)
scientific article
Language Label Description Also known as
English
Unbounded parallel-batching scheduling with two competitive agents
scientific article

    Statements

    Unbounded parallel-batching scheduling with two competitive agents (English)
    0 references
    0 references
    5 February 2014
    0 references
    0 references
    agent scheduling
    0 references
    batching machine
    0 references
    dynamic programming
    0 references
    incompatible or compatible families
    0 references