An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(01)00374-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034737492 / rank | |||
Normal rank | |||
Latest revision as of 10:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved branch-and-bound algorithm for the two machine total completion time flow shop problem |
scientific article |
Statements
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (English)
0 references
3 July 2002
0 references
flow shop scheduling
0 references
branch-and-bound
0 references
Lagrangean relaxation
0 references
0 references
