THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5595194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE |
scientific article; zbMATH DE number 5595194 |
Statements
THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (English)
0 references
14 August 2009
0 references
scheduling
0 references
batching machine
0 references
late work
0 references
NP-hardness
0 references
0 references
0.833598256111145
0 references
0.8087536096572876
0 references
0.8025164604187012
0 references
