The discrete lot-sizing and scheduling problem (Q582202)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 4130177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The discrete lot-sizing and scheduling problem |
scientific article; zbMATH DE number 4130177 |
Statements
The discrete lot-sizing and scheduling problem (English)
0 references
1990
0 references
manufacturing
0 references
Lagrange multipliers
0 references
discrete lot-sizing
0 references
scheduling several products
0 references
branch-and-bound
0 references
Lagrangean relaxation
0 references
Computational results
0 references
0 references
0 references
0.9158063530921936
0 references
0.8827115297317505
0 references
0.8827115297317505
0 references
0.8727973699569702
0 references
