Complexity of two dual criteria scheduling problems (Q2643797)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of two dual criteria scheduling problems |
scientific article; zbMATH DE number 5183111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of two dual criteria scheduling problems |
scientific article; zbMATH DE number 5183111 |
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
