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

From MaRDI portal
Revision as of 00:12, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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