The trim-loss and assortment problems: A survey

DOI10.1016/0377-2217(80)90068-5zbMath0442.90072OpenAlexW1998647932MaRDI QIDQ1143942

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0377-2217(80)90068-5

zbMATH Keywords

survey logistics cutting stock problem exact methods heuristic methods trim-loss problem assortment problems problem taxonomy

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

A residual recombination heuristic for one-dimensional cutting stock problems, Procedures for solving a 1-dimensional cutting problem, Reel and sheet cutting at a paper mill, MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS, On the effectivity of gradient methods for cutting stock problems, An algorithm for the determination of optimal cutting patterns, An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry, A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems, Effective methods for a container packing operation, The one dimensional Compartmentalised Knapsack problem: a case study, A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem, An integrated cutting stock and sequencing problem, Optimising the cutting of wood fibre plates in the hardboard industry, Combined cutting stock and lot-sizing problem with pattern setup, A dynamic programming based heuristic for industrial buying of cardboard, The constrained compartmentalised knapsack problem, An LP-based approach to a two-stage cutting stock problem, An approximation algorithm for solving unconstrained two-dimensional knapsack problems, Exact solutions for constrained two-dimensional cutting problems, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, An introduction to the two‐dimensional rectangular cutting and packing problem, A cutting stock problem in the wood products industry: a two‐stage solution approach, The trim-loss and assortment problems: A survey, The cutting stock problem applied to the hardening process in an automotive spring factory, The cutting stock problem in a hardboard industry: A case study., Exact algorithms for the guillotine strip cutting/packing problem., A linear optimization approach to the combined production planning model, A note on ``Reducing the number of binary variables in cutting stock problems, Trim loss optimization by an improved differential evolution, A coupling cutting stock-lot sizing problem in the paper industry, An enumeration scheme to generate constrained exact checkerboard patterns, An exact model for a slitting problem in the steel industry, Composite stock cutting through simulated annealing, Limiting the number of each piece in two-dimensional cutting stock patterns, Knowledge based approach to the cutting stock problem, Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts, Packing problems, Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost, Physical simulation of a three dimensional palletizing heuristic, Analysis and modelling of a production line in a corrugated box factory, A systematic approach for the three-dimensional palletization problem, A hybrid heuristic to reduce the number of different patterns in cutting stock problems, Checkerboard pattern: proposals for its generation, A two-objective mathematical model without cutting patterns for one-dimensional assortment problems, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, The pallet packing problem for non-uniform box sizes, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, Classification and literature review of integrated lot-sizing and cutting stock problems, Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, The maximum diversity assortment selection problem, A mixed-integer programming model for a class of assortment problems, The stochastic trim-loss problem, Modified greedy heuristic for the one-dimensional cutting stock problem, Solution for the constrained Guillotine cutting problem by simulated annealing, An algorithm for the two-dimensional assortment problem, Linear models for 1-group two-dimensional guillotine cutting problems, A two-phase roll cutting problem, An improved version of Wang's algorithm for two-dimensional cutting problems, Knowledge-based systems for cutting stock problems, A typology of cutting and packing problems, Optimal solutions for the cutting stock problem, The one-dimensional cutting stock problem with usable leftover - a heuristic approach, Solving a two-dimensional trim-loss with MILP, Different transformations for solving non-convex trim-loss problems by MINLP, An approximately global optimization method for assortment problems, Network flows and non-guillotine cutting patterns, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, A heuristic approach to the lumber allocation problem in hardwood dimension and furniture manufacturing, A real-time one-dimensional cutting stock algorithm for balanced cutting patterns, Optimal assortment with concave cost functions, The one-dimensional cutting stock problem with usable leftovers -- a survey

Cites Work