Complexity of two dual criteria scheduling problems (Q2643797): Difference between revisions
From MaRDI portal
Latest revision as of 13:19, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of two dual criteria scheduling problems |
scientific article |
Statements
Complexity of two dual criteria scheduling problems (English)
0 references
27 August 2007
0 references
NP-hard
0 references
dual criteria
0 references
single machine
0 references
0 references