Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (Q2464428)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard |
scientific article |
Statements
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (English)
0 references
20 December 2007
0 references
