A concise survey of efficiently solvable special cases of the permutation flow-shop problem (Q3674391)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A concise survey of efficiently solvable special cases of the permutation flow-shop problem |
scientific article |
Statements
A concise survey of efficiently solvable special cases of the permutation flow-shop problem (English)
0 references
1983
0 references
survey
0 references
permutation flow-shop problem
0 references
weight of a critical path
0 references
associated directed group
0 references
restrictions on job processing times
0 references
bottleneck machines
0 references
lag times
0 references
precedence constraints
0 references
