The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (Q856324): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:59, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard |
scientific article |
Statements
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (English)
0 references
7 December 2006
0 references
scheduling
0 references
batching
0 references
due-dates
0 references
maximum lateness
0 references
multi-operation jobs
0 references
