A typology of cutting and packing problems

From MaRDI portal

Publication:1825761

Jump to:navigation, search

DOI10.1016/0377-2217(90)90350-KzbMath0684.90076OpenAlexW1979415050MaRDI QIDQ1825761

Harald Dyckhoff

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90350-k

zbMATH Keywords

packing nesting cutting stock container loading trim loss typology

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Procedures for solving a 1-dimensional cutting problem, Integrated container loading software for pulp and paper industry, A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem, 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, Loading, unloading and premarshalling of stacks in storage areas: survey and classification, An interactive technique for the cutting stock problem with multiple objectives, On the effectivity of gradient methods for cutting stock problems, Constrained order packing: comparison of heuristic approaches for a new bin packing problem, A hybrid evolutionary algorithm for the two-dimensional packing problem, Cutting optimization of structural tubes to build agricultural light aircrafts, Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem, An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry, A survey on single crane scheduling in automated storage/retrieval systems, Bin packing and cutting stock problems: mathematical models and exact algorithms, An effective shaking procedure for 2D and 3D strip packing problems, Complete and robust no-fit polygon generation for the irregular stock cutting problem, A multi-objective programming approach to 1.5-dimensional assortment problem, One-dimensional cutting stock optimization in consecutive time periods, A simple randomized algorithm for two-dimensional strip packing, Solution approaches for the cutting stock problem with setup cost, Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts, Optimization of roll cutting in clothing industry, Simplest optimal cutting patterns for equal rectangles, The constrained compartmentalised knapsack problem, Palletisation efficiency as a criterion for product design, An effective heuristic for the two-dimensional irregular bin packing problem, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, An application of simulated annealing to the cutting stock problem, A sequential heuristic procedure for one-dimensional cutting, Regular packing of congruent polygons on the rectangular sheet, On the complexity of adjacent resource scheduling, Compaction and separation algorithms for non-convex polygons and their applications, The modified integer round-up property of the one-dimensional cutting stock problem, CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem, An LP-based approach to a two-stage cutting stock problem, An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems, Exact solutions for constrained two-dimensional cutting problems, Guillotineable bin packing: A genetic approach, How to use structural constraints to compute an upper bound for the pallet loading problem, Loading plates with non-identical items, Allowing for weight considerations in container loading, Cut scheduling in the apparel industry, An analytical model for the container loading problem, Nesting planning based on production priorities and technological efficiency, Bounds for nested knapsack problems, Bun splitting: a practical cutting stock problem, Space and time allocation in a shipyard assembly hall, On the cutting stock problem under stochastic demand, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, Generalized hyper-heuristics for solving 2D regular and irregular packing problems, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, A novel hybrid tabu search approach to container loading, A squeaky wheel optimisation methodology for two-dimensional strip packing, The cutting stock problem in a hardboard industry: A case study., Exact algorithms for the guillotine strip cutting/packing problem., A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts, A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems, Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem, The three-dimensional knapsack problem with balancing constraints, Rectangle packing with additional restrictions, Improving competitiveness in veneers production by a simple-to-use DSS., Layer-layout-based heuristics for loading homogeneous items into a single container, Trim loss optimization by an improved differential evolution, A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach, Solving circle packing problems by global optimization: numerical results and industrial applications, Cutting stock problems and solution procedures, Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders), Reactive GRASP for the strip-packing problem, Bin packing with fragmentable items: presentation and approximations, Solving sequential interval cutting problems via dynamic programming, Packing problems, A fast heuristic for a three-dimensional non-convex domain loading problem, Chips on wafers, or packing rectangles into grids, A two-objective mathematical model without cutting patterns for one-dimensional assortment problems, Average-case analysis of cutting and packing in two dimensions, A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming, Classification and literature review of integrated lot-sizing and cutting stock problems, Algorithms for the one-dimensional two-stage cutting stock problem, Stabilized branch-and-price algorithms for vector packing problems, The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio, Sequencing mixed-model assembly lines: survey, classification and model critique, The stochastic trim-loss problem, Solution for the constrained Guillotine cutting problem by simulated annealing, Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem, The solution of two-stage guillotine cutting stock problems having extremely varying order demands, Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach, Setup minimising conditions in the trim loss problem, Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Cutting circles and polygons from area-minimizing rectangles, The one-dimensional cutting stock problem with due dates, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming, 4-block heuristic for the rectangle packing problem, An exact depth-first algorithm for the pallet loading problem, Stability aspects of pallet loading, Software zur Verpackungslogistik. Übersicht und Vergleich. (Software for the logistics of packing), Enforcing minimum run length in the cutting stock problem, List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan, FITTING A TABLE TO A PAGE USING NONLINEAR OPTIMIZATION, An efficient method for the three-dimensional container loading problem by forming box sizes, Modeling and solving the endpoint cutting problem, An introduction to the two‐dimensional rectangular cutting and packing problem, Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, A genetic algorithm for optimizing space utilization in aircraft hangar shop, A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, A review of synchronization problems in parts-to-picker warehouses, Slicing tree's geometric potential: an indicator for layout problems based on slicing tree structure, O problema de corte de estoque em indústrias de móveis de pequeno e médio portes, Analysing trade‐offs in container loading: combining load plan construction heuristics with agent‐based simulation, Concurrent engineering in a high variety label printing environment, The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP, A Genetic Algorithm for Solving the Container Loading Problem, Analysis of upper bounds for the pallet loading problem, Fuzzy bin packing problem., Checkerboard pattern: proposals for its generation, Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB), Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor, Consecutive ones matrices for multi-dimensional orthogonal packing problems, Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions, A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm, Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem, Linear models for 1-group two-dimensional guillotine cutting problems, Cutting optimization with variable-sized stock and inventory status data, Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound, Unnamed Item, Statistical mechanics analysis of generalized multi-dimensional knapsack problems, Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints, A residual recombination heuristic for one-dimensional cutting stock problems, A simulated annealing approach for the circular cutting problem, A population heuristic for constrained two-dimensional non-guillotine cutting, Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms, A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints, A caving degree approach for the single container loading problem, Multi-objective optimization of the 3D container stowage planning problem in a barge convoy system, The geometry of nesting problems: a tutorial, An improved typology of cutting and packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A hybrid genetic algorithm for the two-dimensional single large object placement problem, The one dimensional Compartmentalised Knapsack problem: a case study, Accelerating column generation for variable sized bin-packing problems, An integrated cutting stock and sequencing problem, Alternative configurations for cutting machines in a tube cutting mill, Optimising the cutting of wood fibre plates in the hardboard industry, Exhaustive approaches to 2D rectangular perfect packings, Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers, Combined cutting stock and lot-sizing problem with pattern setup, Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes, Arc-flow model for the two-dimensional guillotine cutting stock problem, Heuristics for the integer one-dimensional cutting stock problem: A computational study, Interactive procedures in large-scale two-dimensional cutting stock problems, A family of genetic algorithms for the pallet loading problem, Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, Space defragmentation for packing problems, Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation, Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing, A heuristic approach to minimize the number of saw cycles in small-scale furniture factories, Packing chained items in aligned bins with applications to container transshipment and project scheduling, PACKING A TRUCK — NOW WITH A TWIST!, Packing circles into perimeter-minimizing convex hulls, A generalized classification scheme for crane scheduling with interference, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, A mathematical modeling approach to optimize composite parts placement in autoclave, Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem, A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems, A note on ``Reducing the number of binary variables in cutting stock problems, A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber, A new quasi-human algorithm for solving the packing problem of unit equilateral triangles, A moment based metric for 2-D and 3-D packing, A survey on the cutting and packing problems, Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds, Design of rectangular packings using decoders of block structure, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, Optimal job splitting on a multi-slot machine with applications in the printing industry, Solving the variable size bin packing problem with discretized formulations, An enumeration scheme to generate constrained exact checkerboard patterns, A polynomial algorithm for one problem of guillotine cutting, BPPLIB: a library for bin packing and cutting stock problems, A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function, Cutting ellipses from area-minimizing rectangles, Mathematical models and decomposition methods for the multiple knapsack problem, Matching supply and demand in a sharing economy: classification, computational complexity, and application, Adaptive and restarting techniques-based algorithms for circular packing problems, Solving a combined cutting-stock and lot-sizing problem with a column generating procedure, Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost, Efficient algorithms for real-life instances of the variable size bin packing problem, Three-dimensional container loading models with cargo stability and load bearing constraints, Heuristics and lower bounds for the bin packing problem with conflicts, Strip generation algorithms for constrained two-dimensional two-staged cutting problems, Putting continuous metaheuristics to work in binary search spaces, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes, A combined approach to the solution to the general one-dimensional cutting stock problem, Renovation of the cutting stock process, A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks, Dynamic programming algorithms for the optimal cutting of equal rectangles, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, The forgotten sons: warehousing systems for brick-and-mortar retail chains, Exact solution techniques for two-dimensional cutting and packing, The one-dimensional cutting stock problem with sequence-dependent cut losses, An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem, The maximum diversity assortment selection problem, Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings, Approximation algorithm for the oriented two-dimensional bin packing problem, A hybrid approach for optimization of one-dimensional cutting, A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders, Integer linear programming for a cutting problem in the wood-processing industry: a case study, Container loading with multi-drop constraints, The pinwheel pattern and its application to the manufacturer's pallet-loading problem, An efficient approach for the multi-pallet loading problem, A method of optimal lattice packing of congruent oriented polygons in the plane, L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing, Three-dimensional packing of items with limited load bearing strength, Introducing global constraints in CHIP, A genetic algorithm solution for one-dimensional bundled stock cutting, Heuristics for the container loading problem, LP models for bin packing and cutting stock problems, 3-D container packing heuristics, A branch-and-price algorithm for the temporal bin packing problem, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, An improved best-fit heuristic for the orthogonal strip packing problem, An application of deterministic and robust optimization in the wood cutting industry, Densest translational lattice packing of non-convex polygons, Evaluation of algorithms for one-dimensional cutting, 2DPackLib: a two-dimensional cutting and packing library, The one-dimensional cutting stock problem with usable leftovers -- a survey

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1825761&oldid=14191965"