Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395)

From MaRDI portal
Revision as of 23:32, 28 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127251377, #quickstatements; #temporary_batch_1722205759638)
scientific article
Language Label Description Also known as
English
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
scientific article

    Statements

    Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (English)
    0 references
    14 July 2002
    0 references
    Scheduling
    0 references
    Computational complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers