Title of article :
Multi-dimensionalbinpackingproblemswithguillotineconstraints
Author/Authors :
Rasmus R.Amossen ، نويسنده , , DavidPisinger، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Pages :
8
From page :
1999
To page :
2006
Abstract :
The problemaddressedinthispaperisthedecisionproblemofdeterminingifasetofmulti- dimensionalrectangularboxescanbeorthogonallypackedintoarectangularbinwhilesatisfyingthe requirementthatthepackingshouldbe guillotinecuttable. Thatis,thereshouldexistaseriesofface parallelstraightcutsthatcanrecursivelycutthebinintopiecessothateachpiececontainsaboxandno box hasbeenintersectedbyacut.TheunrestrictedproblemisknowntobeNP-hard.Inthispaperwe present ageneralizationofaconstructivealgorithmforthemulti-dimensionalbinpackingproblem, with andwithouttheguillotineconstraint,basedonconstraintprogramming.
Keywords :
Constraint programming , Packing , Cutting
Journal title :
Computers and Operations Research
Serial Year :
2010
Journal title :
Computers and Operations Research
Record number :
927805
Link To Document :
بازگشت