Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (Q1266667)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard |
scientific article |
Statements
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (English)
0 references
7 October 1998
0 references
NP-hardness
0 references
preemptive scheduling
0 references
two-stage flow shop
0 references
identical parallel machines
0 references
makespan
0 references
