Name
Title | ||
|---|---|---|
Matheuristics for the lot sizing problem with back-ordering, setup carry-overs, and non-identical machines |
Abstract | ||
|---|---|---|
•A generalized version of the Capacitated Lot Sizing Problem is considered.•Three matheuristic algorithms exploiting the problem features have been designed.•The Feasibility Pump outperforms the other algorithms and two MIP solvers.•FP outperforms a specialized algorithm on three different ELSP problems as well. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cie.2018.11.023 | Computers & Industrial Engineering |
Keywords | DocType | Volume |
Scheduling,Matheuristics,Lot sizing,Back-orders,Setup carry-over | Journal | 127 |
ISSN | Citations | PageRank |
0360-8352 | 0 | 0.34 |
References | Authors | |
12 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Ghirardi | 1 | 93 | 10.14 |
| Andrea Amerio | 2 | 0 | 0.34 |