Unbounded parallel-batching scheduling with two competitive agents (Q2434303): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 22:49, 2 February 2024

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
    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