Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (Q1266667)
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: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard |
scientific article; zbMATH DE number 1208592
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard |
scientific article; zbMATH DE number 1208592 |
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
0.8855589
0 references
0.8733082
0 references
0.87211025
0 references
0.87173426
0 references
0.8711852
0 references
0.8686534
0 references
0.8682362
0 references
