Two branch and bound algorithms for the permutation flow shop problem (Q1266538): 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.1016/0377-2217(95)00352-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012238981 / rank | |||
Normal rank | |||
Revision as of 22:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two branch and bound algorithms for the permutation flow shop problem |
scientific article |
Statements
Two branch and bound algorithms for the permutation flow shop problem (English)
0 references
29 November 1998
0 references
branch-and-bound
0 references
exact methods
0 references
permutation flow shop problem
0 references
heads and tails
0 references
