On the complexity of minimizing the number of late jobs in unit time open shop (Q1962026)
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: Publication:1962026 |
scientific article; zbMATH DE number 1394996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of minimizing the number of late jobs in unit time open shop |
scientific article; zbMATH DE number 1394996 |
Statements
On the complexity of minimizing the number of late jobs in unit time open shop (English)
0 references
30 January 2000
0 references
complexity
0 references
unit time open shop
0 references
unary NP-hard
0 references
0.9110361933708192
0 references
0.8778309226036072
0 references
0.8576162457466125
0 references
0.8576162457466125
0 references
0.8556566834449768
0 references
