The routing open-shop problem on a network: complexity and approximation (Q2496075)

From MaRDI portal
Revision as of 17:49, 24 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
The routing open-shop problem on a network: complexity and approximation
scientific article

    Statements

    The routing open-shop problem on a network: complexity and approximation (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    0 references
    heuristics
    0 references
    scheduling
    0 references
    approximation
    0 references
    0 references