The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard (Q2464401): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:33, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard |
scientific article |
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
