Reducing the number of cuts in generating three-staged cutting patterns
Authors:
- Yaodong CuiYCYaodong Cui
- Baixiong HuangBHBaixiong Huang
- 1 April 2012
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 218 (2) , 358-365
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A heuristic for the one-dimensional cutting stock problem with usable leftoverEuropean Journal of Operational Research, 2010
- Strips minimization in two-dimensional cutting stock of circular itemsComputers & Operations Research, 2010
- The one-dimensional cutting stock problem with usable leftover – A heuristic approachEuropean Journal of Operational Research, 2009
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generationEuropean Journal of Operational Research, 2008
- A heuristic for the one-dimensional cutting stock problem with pattern reductionProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2008
- Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patternsComputers & Operations Research, 2008
- Generating optimal T-shape cutting patterns for rectangular blanksProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2004
- A new approach for the solution of the two-dimensional guillotine-cutting problem in ship productionOcean Engineering, 2004
- Multistage Cutting Stock Problems of Two and More DimensionsOperations Research, 1965
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961