A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational study of the permutation flow shop problem based on a tight lower bound |
scientific article |
Statements
A computational study of the permutation flow shop problem based on a tight lower bound (English)
0 references
12 May 2005
0 references
Scheduling
0 references
Permutation flow shop
0 references
Branch-and-bound algorithm
0 references
0 references
