A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270)

From MaRDI portal
Revision as of 07:59, 29 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1782040)
scientific article
Language Label Description Also known as
English
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
scientific article

    Statements

    A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (English)
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    scheduling
    0 references
    parallel batch machines
    0 references
    on-line
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references