The determination of the guillotine restrictions for a rectangular cutting-stock pattern

Authors:
Daniela Marinescu;Alexandra Băicoianu
Affiliations:
Transilvania University of Braşov, Department of Computer Science, Braşov, Romania;Transilvania University of Braşov, Department of Computer Science, Braşov, Romania
Venue:
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Year:
2010

Citing 3
Cited 3

Introduction to algorithms

Introduction to algorithms
A decomposition problem of a natural number for a rectangular cutting-covering model

ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
An algorithm for the guillotine restrictions verification in a rectangular covering model

WSEAS Transactions on Computers

An algorithm for determination of the guillotine restrictions for a rectangular cutting-stock pattern

WSEAS Transactions on Computers
The determination of the guillotine restrictions for a rectangular three dimensional bin packing pattern

Proceedings of the 15th WSEAS international conference on Computers
A test of the guillotine restrictions determination for a rectangular three dimensional bin packing problem

WSEAS Transactions on Information Science and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a two-dimensional rectangular Cutting-Stock problem in case of a cutting pattern with gaps. First we present two new graph representations of the cutting pattern, weighted graph of downward adjacency and weighted graph of rightward adjacency. Using this kind of representation we propose a method to verify guillotine restrictions of the pattern which can be applied for cutting-stock pattern with gaps but also for the covering pattern without gaps and overlapping.