2 articles for “cutting stock problems”

Set a search alert

Research ArticleOpen accessIn the keywordsSolving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning ObjectiveSirirat Wongprakornkul, Peerayuth CharnsethikulProblem statement: One-dimensional cutting stock problem with discrete demands and capacitated planning objective is an NP hard problem. Approach: The mathematical model with column-generation technique by a branch-and-bound procedure and the heuristic based on the first fit decreasing method are proposed. Then, both approaches were compared and some characteristics were investigated such as upper-bound value, percentage above lower-bound value, computation … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 7,947 accessesView PDF Cite

Research ArticleOpen accessIn the abstractOptimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation ProblemSirirat Wongprakornkul, Peerayuth CharnsethikulIn this work, the integration of the one-dimensional cutting stock problem with multiple cutting facilities and the transportation problem was formulated mathematically as a large-scale discrete optimization problem. Benders partitioning approach and the column-generation technique with the direct method and the proposed heuristic method for solving corresponding integer programming (IP) were developed into three approaches and were used to solve … …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 6,741 accessesView PDF Cite