A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time (Q2499163)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time |
scientific article |
Statements
A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time (English)
0 references
14 August 2006
0 references
hybrid flowshop scheduling
0 references
total weighted completion time
0 references
Lagrangian relaxation
0 references
dynamic programming
0 references
subgradient optimization
0 references
0 references
0 references
