A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop (Q1121779)
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 algorithm to minimize the number of late jobs in a permutation flow-shop |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop |
scientific article |
Statements
A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop (English)
0 references
1989
0 references
m-machine permutation flow-shop
0 references
lower bound
0 references
branch and bound
0 references
Computational experience
0 references
0 references
0 references
