A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines (Q3163722)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines |
scientific article |
Statements
A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines (English)
0 references
26 October 2010
0 references
scheduling
0 references
hybrid flow shop
0 references
computational complexity
0 references
