A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-005-2444-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021347904 / rank | |||
Normal rank | |||
Revision as of 23:11, 19 March 2024
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
