Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems (Q3964310)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems |
scientific article |
Statements
Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems (English)
0 references
1982
0 references
minimal length non-preemptive scheduling problem
0 references
three-stage flow shop
0 references
polynomial scheduling algorithms
0 references
NP-completeness
0 references
