Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 63, Issue 2, Pages 183-200Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1057/jors.2011.6
Keywords
cutting and packing; two-dimensional non-guillotine cutting pattern; dynamic programming; recursive approach; distributor's pallet loading problem
Ask authors/readers for more resources
In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. Journal of the Operational Research Society (2012) 63, 183-200. doi: 10.1057/jors.2011.6 Published online 17 August 2011
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available