NP-hardness of shop-scheduling problems with three jobs (Q1893158)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness of shop-scheduling problems with three jobs |
scientific article |
Statements
NP-hardness of shop-scheduling problems with three jobs (English)
0 references
13 May 1996
0 references
optimal makespan
0 references
job-shop
0 references
open-shop
0 references
maximum completion time
0 references
mean flow time
0 references
complexity of shop-scheduling
0 references
NP-hardness proof
0 references
0 references
