An efficient approach for large-scale two-dimensional guillotine cutting stock problems

DOI10.1057/palgrave.jors.2600638zbMath1140.90374OpenAlexW1969716703MaRDI QIDQ3157808

Didier Fayard, Mhand Hifi, Vassilios Zissimopoulos

Publication date: 19 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600638

zbMATH Keywords

heuristicsdynamic programmingknapsack problemcombinatorial optimisationcutting problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (26)

Exact algorithm for generating two-segment cutting patterns of punched strips ⋮ Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock ⋮ Two-stage general block patterns for the two-dimensional cutting problem ⋮ A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ A new dynamic programming procedure for three-staged cutting patterns ⋮ Exact algorithms for the guillotine strip cutting/packing problem. ⋮ An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems ⋮ Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem ⋮ A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns ⋮ A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects ⋮ T-shape homogeneous block patterns for the two-dimensional cutting problem ⋮ Simple block patterns for the two-dimensional cutting problem ⋮ Fast heuristic for constrained homogenous T-shape cutting patterns ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems ⋮ A recursive algorithm for constrained two-dimensional cutting problems ⋮ A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces ⋮ Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ 2DPackLib: a two-dimensional cutting and packing library

This page was built for publication: An efficient approach for large-scale two-dimensional guillotine cutting stock problems