A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
From MaRDI portal
Recommendations
- A new heuristic for rectangular stock-cutting problem
- A new heuristic algorithm for the one-dimensional cutting stock problem
- A new heuristic for the linear placement problem
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem
- A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem
- scientific article; zbMATH DE number 3954634
- A heuristic approach to one-dimensional cutting stock problem
- A Two-phase Heuristic for the Two-dimensional Cutting-stock Problem
Cited in
(89)- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Mathematical justification of a heuristic for statistical correlation of real-life time series
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- Exact and heuristic methods for optimizing lock-quay system in inland waterway
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- A reference length approach for the 3D strip packing problem
- Exact solution techniques for two-dimensional cutting and packing
- The maximum diversity assortment selection problem
- A hybrid metaheuristic for the two-dimensional strip packing problem
- 2DPackLib: a two-dimensional cutting and packing library
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
- Scheduling unrelated additive manufacturing machines with practical constraints
- Single workgroup scheduling problem with variable processing personnel
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Deterministic model for customized pilot manufacture production with various backplane sizes
- Mathematical modeling and optimal blank generation in glass manufacturing
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- Upper bounds for heuristic approaches to the strip packing problem
- Data structures for higher-dimensional rectilinear packing
- An improved best-fit heuristic for the orthogonal strip packing problem
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- Combinatorial Benders' cuts for the strip packing problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- Jostling for position: local improvement for irregular cutting patterns
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- An effective shaking procedure for 2D and 3D strip packing problems
- Efficient implementations of construction heuristics for the rectilinear block packing problem
- A simple randomized algorithm for two-dimensional strip packing
- An exact strip packing algorithm based on canonical forms
- Corner occupying theorem for the two-dimensional integral rectangle packing problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- The three-dimensional knapsack problem with balancing constraints
- Asymptotically optimal scheduling of random malleable demands in smart grid
- An iterated local search algorithm for a place scheduling problem
- New lower bound and exact method for the continuous berth allocation problem
- A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- Numerical optimization method for packing regular convex polygons
- An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Rectangle packing with a recursive pilot method
- Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A hybrid placement strategy for the three-dimensional strip packing problem
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints
- Artificial intelligence application in production scheduling problem systematic literature review: bibliometric analysis, research trend, and knowledge taxonomy
- A skyline-based heuristic for orthogonal packing rectangles in a circle
- A lock and port resource collaborative scheduling method based on mathematical programming model and heuristic
- A goal-driven iterated local search approach based on the maximal-space for the circle bin-packing problem with rectangular items
- Solving the strip packing problem with a decomposition framework and a generic solver: implementation, tuning, and reinforcement-learning-based hybridization
- An effective evolutionary algorithm for packing rectangles into a fixed size circular container
- Computing maximum polygonal packings in convex polygons using best-fit, genetic algorithms and ILPs (CG challenge)
- A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem
- Mathematical models and heuristic algorithms for pallet building problems with practical constraints
- Filtered beam search algorithm for the two-dimensional rectangular packing problem
- Hybrid-biased genetic algorithm for packing unequal rectangles into a fixed-size circle
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- A tetris beam search algorithm for the distributor's pallet loading problem
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- Reactive GRASP for the strip-packing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
This page was built for publication: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321741)