A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953)
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 branch-and-bound approach to the no-idle flowshop scheduling problem |
scientific article; zbMATH DE number 7809942
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound approach to the no-idle flowshop scheduling problem |
scientific article; zbMATH DE number 7809942 |
Statements
A branch-and-bound approach to the no-idle flowshop scheduling problem (English)
0 references
27 February 2024
0 references
branch and bound
0 references
machine based lower bounds
0 references
no-idle flowshop scheduling problem
0 references
iterated local search
0 references
0 references
0 references
0.8585668206214905
0 references
0.8346865177154541
0 references
0.824938178062439
0 references
0.8215053677558899
0 references
0.8185769319534302
0 references
