The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (Q856324)
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: The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard |
scientific article; zbMATH DE number 5078548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard |
scientific article; zbMATH DE number 5078548 |
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
0 references
0.9766868948936462
0 references
0.8555905818939209
0 references
0.8498414754867554
0 references
0.8298518657684326
0 references
