Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:19, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness |
scientific article |
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
