A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158)
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: A computational study of the permutation flow shop problem based on a tight lower bound |
scientific article; zbMATH DE number 2168006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational study of the permutation flow shop problem based on a tight lower bound |
scientific article; zbMATH DE number 2168006 |
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
0.8745266795158386
0 references
0.8511202335357666
0 references
0.8467207551002502
0 references
0.8412140011787415
0 references
