Pareto-scheduling of two competing agents with their own equal processing times (Q2140187)

From MaRDI portal
Revision as of 21:44, 31 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Pareto-scheduling of two competing agents with their own equal processing times
scientific article

    Statements

    Pareto-scheduling of two competing agents with their own equal processing times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 May 2022
    0 references
    scheduling
    0 references
    single machine
    0 references
    Pareto frontier
    0 references
    two-agent
    0 references
    own equal processing times
    0 references

    Identifiers