Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2009.04.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2009.04.008 / rank | |||
Normal rank | |||
Latest revision as of 02:28, 10 December 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
0 references
0 references
