The determination of the guillotine restrictions for a rectangular three dimensional bin packing pattern

Authors:
Daniela Marinescu;Alexandra Băicoianu;Dana Simian
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;University Lucian Blaga of Sibiu, Department of Computer Science, Sibiu, Romania
Venue:
Proceedings of the 15th WSEAS international conference on Computers
Year:
2011

Citing 6
Cited 1

Introduction to algorithms

Introduction to algorithms
A topological order for a rectangular three dimensional bin packing problem

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
An algorithm for the guillotine restrictions verification in a rectangular covering model

WSEAS Transactions on Computers
Multi-dimensional bin packing problems with guillotine constraints

Computers and Operations Research
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 cutting-stock pattern

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I

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

This paper is regarding to the rectangular three dimensional bin packing problem, where a bin is loaded with a set of rectangular boxes, without overlapping. One of the most popular restriction for the solution of the 3D-bin packing problem is the guillotine restriction. That means that the packing patterns are so that the boxes can be obtained by sequential face-to-face cutting plane parallel to a face of the bin. Our objective is to find a method for verifying if a solution of the 3D-bin packing problem has the guillotine constrains or not. For this purpose we use a weighed graph representation of a solution of the problem, the generalization of this kind of representation obtained by us for 2D-cutting stock problem in [9, 10, 11].