Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155)
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: Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior |
scientific article; zbMATH DE number 6938891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior |
scientific article; zbMATH DE number 6938891 |
Statements
Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (English)
0 references
18 September 2018
0 references
nonlinear integer programming
0 references
dynamic lot-sizing
0 references
production planning
0 references
queueing
0 references
rounding heuristic
0 references
feasibility pump heuristic
0 references
surrogate problem method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7890910506248474
0 references
0.7876520752906799
0 references
0.7774007320404053
0 references
0.7771630883216858
0 references
0.7757811546325684
0 references
