Scheduling permutation flow shops using the Lagrangian relaxation technique (Q1374432)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1094932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling permutation flow shops using the Lagrangian relaxation technique |
scientific article; zbMATH DE number 1094932 |
Statements
Scheduling permutation flow shops using the Lagrangian relaxation technique (English)
0 references
4 December 1997
0 references
inherent duality gap
0 references
separable integer programming
0 references
Lagrangian relaxation
0 references
permutation flow shops
0 references
reduced complexity bundle method
0 references
0.8155604004859924
0 references
0.8068355321884155
0 references
0.8051851987838745
0 references
