Combined cutting stock and lot-sizing problem with pattern setup

Ning Ma, Ya Liu, Zhili Zhou, Chengbin Chu

Abstract: Highlights•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.