Combined cutting stock and lot-sizing problem with pattern setup
Lists
Only you see this
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.
BibTeX
@inproceedings{ma2018combined,
author = {Ning Ma and Ya Liu and Zhili Zhou and Chengbin Chu},
title = {{Combined cutting stock and lot-sizing problem with pattern setup}},
booktitle = {Comput. Oper. Res},
year = {2018},
url = {https://openreview.net/forum?id=sWjES30Ubv},
}Loading related content...