Solving makespan minimization problems with Lagrangean decomposition (Q1209146)
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 167437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving makespan minimization problems with Lagrangean decomposition |
scientific article; zbMATH DE number 167437 |
Statements
Solving makespan minimization problems with Lagrangean decomposition (English)
0 references
16 May 1993
0 references
makespan
0 references
single stage manufacturing process
0 references
parallel machines
0 references
multiple job types
0 references
plant location
0 references
constrained 0-1 knapsack problems
0 references
Lagrangean dual bound
0 references
0.7645400762557983
0 references
0.7616500854492188
0 references
