Optimization of roll cutting in clothing industry
Computers and Operations Research
Exact algorithms for the guillotine strip cutting/packing problem
Computers and Operations Research
An algorithm for the determination of optimal cutting patterns
Computers and Operations Research
A new evolutionary approach to cutting stock problems with and without contiguity
Computers and Operations Research
Row and column generation technique for a multistage cutting stock problem
Computers and Operations Research
Evaluation of algorithms for one-dimensional cutting
Computers and Operations Research
A Heuristic Particle Swarm Optimization for Cutting Stock Problem Based on Cutting Pattern
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
An optimization algorithm for cutting stock problems in the TFT-LCD industry
Computers and Industrial Engineering
Mass customization in cutting stock process
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
A CAM system for one-dimensional stock cutting
Advances in Engineering Software
One-Dimensional Cutting Stock Optimization with Usable Leftover: A Case of Low Stock-to-Order Ratio
International Journal of Decision Support System Technology
Computers and Industrial Engineering
| Hi-index | 0.01 |
In this article a combined method for the solution to the general one-dimensional cutting stock problem (G1D-CSP) is proposed. The main characteristic of G1D-CSP lies in that all stock lengths can be different. The new approach combines two existing methods: sequential heuristic procedure (SHP) and branch-and-bound. The algorithm based on the proposed method leads to almost optimal solutions, which are substantially better than the solutions of known methods at the expense of slightly increased time complexity, which is still low. So, the new method is suitable for all sizes of the problem. A comparison with the SHP is presented.