A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518)

From MaRDI portal
Revision as of 10:15, 2 August 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
A Lagrangian approach to single-machine scheduling problems with two competing agents
scientific article

    Statements

    A Lagrangian approach to single-machine scheduling problems with two competing agents (English)
    0 references
    0 references
    0 references
    0 references
    8 March 2010
    0 references
    branch-and-bound
    0 references
    Lagrangian relaxation
    0 references
    multi-agent scheduling
    0 references
    single-machine scheduling
    0 references

    Identifiers