@inproceedings{2c4ba1b7bf1e4ab1a93a59d408699db2,
title = "Novel global optimization for separated cutting stock problems",
abstract = "This separated cutting stock problem is a packaging of all rectangular pieces into a predefined size of material stocks using a minimum amount of these materials. It is similar to the trim-loss problem of subtracting the cost of a knife setup and adding the requirement of using the mini-mum number of material stocks. Current solving methods include the cutting stock problem, trim-loss problems, or assortment problems, which are not suitable for obtaining the global minimum number of material stocks with a predefined size to meet all the demanding smaller rectangles. We call this problem the separated cutting stock problem (SCSP). This paper proposes a novel method of identifying the global optimal solution for the SCSP. Numerical example demonstrates that the proposed method is more practical and efficient compared with other current approaches.",
keywords = "Cutting stock problem, Global optimization",
author = "Lu, {Hao Chun} and Liu, {Shang Chia} and Wu, {Tsung Hsien}",
year = "2009",
doi = "10.1109/CISE.2009.5367065",
language = "English",
isbn = "9781424445073",
series = "Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009",
booktitle = "Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009",
note = "2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 ; Conference date: 11-12-2009 Through 13-12-2009",
}