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 OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling multi-operation jobs on a single machine / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Batch scheduling to minimize maximum lateness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank | |||
Normal rank | |||
Latest revision as of 11:20, 25 June 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
0 references
