Tight bounds for the identical parallel machine scheduling problem (Q3429035)

From MaRDI portal
Revision as of 16:41, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Tight bounds for the identical parallel machine scheduling problem
scientific article

    Statements

    Tight bounds for the identical parallel machine scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    30 March 2007
    0 references
    0 references
    0 references