The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard (Q2464401): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1024858623282 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1491174955 / rank | |||
Normal rank | |||
Latest revision as of 10:18, 30 July 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
