The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard (Q2464401)
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 5221913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard |
scientific article; zbMATH DE number 5221913 |
Statements
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard (English)
0 references
20 December 2007
0 references
0.9766868948936462
0 references
0.8678627014160156
0 references
0.83677738904953
0 references
0.8332878947257996
0 references
0.8144145011901855
0 references
