The trim-loss and assortment problems: A survey
From MaRDI portal
Publication:1143942
DOI10.1016/0377-2217(80)90068-5zbMath0442.90072MaRDI 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
survey; logistics; cutting stock problem; exact methods; heuristic methods; trim-loss problem; assortment problems; problem taxonomy
90C90: Applications of mathematical programming
90C10: Integer programming
90B05: Inventory, storage, reservoirs
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
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, Checkerboard pattern: proposals for its generation, MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS, Linear models for 1-group two-dimensional guillotine cutting problems, Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts, An algorithm for the two-dimensional assortment problem, Network flows and non-guillotine cutting patterns, A heuristic approach to the lumber allocation problem in hardwood dimension and furniture manufacturing, The constrained compartmentalised knapsack problem, A coupling cutting stock-lot sizing problem in the paper industry, Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths, The stochastic trim-loss problem, The one-dimensional cutting stock problem with usable leftover - a heuristic approach, A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems, A dynamic programming based heuristic for industrial buying of cardboard, 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, The trim-loss and assortment problems: A survey, 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, Packing problems, Solution for the constrained Guillotine cutting problem by simulated annealing, 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, A real-time one-dimensional cutting stock algorithm for balanced cutting patterns, Procedures for solving a 1-dimensional cutting problem, On the effectivity of gradient methods for cutting stock problems, An algorithm for the determination of optimal cutting patterns, Effective methods for a container packing operation, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, The cutting stock problem in a hardboard industry: A case study., Exact algorithms for the guillotine strip cutting/packing problem., An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, A mixed-integer programming model for a class of assortment 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, Reel and sheet cutting at a paper mill, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, An enumeration scheme to generate constrained exact checkerboard patterns, A hybrid heuristic to reduce the number of different patterns in cutting stock problems, 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, 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, Optimal assortment with concave cost functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The trim-loss and assortment problems: A survey
- Dynamic Version of the Economic Lot Size Model
- A Few Remarks on the Assortment Problem
- Mathematical Methods of Organizing and Planning Production
- The Trim Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- A Note on a Two-dimensional Dynamic Programming Problem
- The Assortment Problem with Probabilistic Demands
- The knapsack problem: A survey
- A Solution of the Rectangular Cutting-Stock Problem
- An Algorithm for Two-Dimensional Cutting Problems
- A Note on the Two-Dimensional Rectangular Cutting-Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- A Multistage Solution of the Template-Layout Problem
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
