Solvable cases of the flow-shop problem without interruptions in job processing (Q3670908)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3825545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solvable cases of the flow-shop problem without interruptions in job processing |
scientific article; zbMATH DE number 3825545 |
Statements
Solvable cases of the flow-shop problem without interruptions in job processing (English)
0 references
1983
0 references
flow-shop problem without interruptions
0 references
Gilmore-Gomory's algorithm
0 references
lower completion time bound
0 references
minimal completion time
0 references
