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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.027 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2032041770 / rank | |||
Normal rank | |||
Revision as of 22:43, 19 March 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
