Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544)
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: Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness |
scientific article; zbMATH DE number 5616474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness |
scientific article; zbMATH DE number 5616474 |
Statements
Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (English)
0 references
16 October 2009
0 references
hybrid flowshop scheduling
0 references
Lagrangian relaxation
0 references
cut generation
0 references
dynamic programming
0 references
0 references
0 references
0.8815447092056274
0 references
0.8068608045578003
0 references
0.8063461184501648
0 references
