Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems (Q3964310)
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: Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems |
scientific article; zbMATH DE number 3786486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems |
scientific article; zbMATH DE number 3786486 |
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
