A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122)
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 makespan in a flowshop with blocking |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking |
scientific article |
Statements
A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (English)
0 references
7 March 2006
0 references
flowshop
0 references
blocking
0 references
makespan
0 references
lower bound
0 references
branch-and-bound
0 references
