Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127251377, #quickstatements; #temporary_batch_1722205759638 |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00143-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2013271485 / rank | |||
Normal rank |
Latest revision as of 10:59, 30 July 2024
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