On complexity of minimizing weighted number of late jobs in unit time open shops (Q1356519)
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: On complexity of minimizing weighted number of late jobs in unit time open shops |
scientific article; zbMATH DE number 1018594
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity of minimizing weighted number of late jobs in unit time open shops |
scientific article; zbMATH DE number 1018594 |
Statements
On complexity of minimizing weighted number of late jobs in unit time open shops (English)
0 references
9 June 1997
0 references
weighted number of late jobs
0 references
open shop
0 references
release dates
0 references
unit time operations
0 references
\({\mathcal N}{\mathcal P}\)-hard
0 references
0.9723222
0 references
0.96327114
0 references
0.9484489
0 references
0.9433868
0 references
0.9040298
0 references
0.9026519
0 references
0.8975631
0 references
0.88796705
0 references
0.88418293
0 references
