Name
Abstract | ||
|---|---|---|
•We concentrate on a combined one-dimensional cutting stock and lot-sizing problem with pattern setup.•A Mixed Integer Programming model is formulated and a lower bound is generated based on column generation procedure.•A dynamic programming-based heuristic is proposed, in which each pattern is explored step by step while preserving a global view.•The proposed method generates efficient solutions compared with the optimal solutions, lower bounds and current procedure in practice. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.cor.2018.02.016 | Computers & Operations Research |
Keywords | Field | DocType |
Cutting stock,Lot-sizing,Setup,Dynamic programming,Heuristics | Dynamic programming,Heuristic,Mathematical optimization,Upper and lower bounds,Average cost,Linear programming,Sizing,Total cost,Mathematics,Recursion | Journal |
Volume | ISSN | Citations |
95 | 0305-0548 | 2 |
PageRank | References | Authors |
0.37 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ning Ma | 1 | 45 | 5.95 |
| Ya Liu | 2 | 8 | 3.83 |
| Zhili Zhou | 3 | 37 | 3.64 |
| Chengbin Chu | 4 | 1486 | 126.84 |