Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation (Q922280)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:922280 |
scientific article; zbMATH DE number 4167836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation |
scientific article; zbMATH DE number 4167836 |
Statements
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation (English)
0 references
1990
0 references
branch-and-bound
0 references
two-machine flow shop
0 references
Lower bounds
0 references
precedence contraints
0 references
Lagrangian relaxation
0 references
linear ordering
0 references
Computational experiments
0 references
0.8829655647277832
0 references
0.8746265172958374
0 references
0.861506998538971
0 references
0.8560863137245178
0 references
0.8559970855712891
0 references
