Scheduling inspired models for two-dimensional packing problems
From MaRDI portal
Recommendations
- Two-dimensional packing problems: a survey
- An exact algorithm for the two-dimensional strip-packing problem
- Exact solution techniques for two-dimensional cutting and packing
- An exact strip packing algorithm based on canonical forms
- A new constraint programming approach for the orthogonal packing problem
Cites work
- A branch and bound algorithm for the strip packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- An efficient placement heuristic for three-dimensional rectangular packing
- An exact approach to the strip-packing problem
- An improved typology of cutting and packing problems
- Exact algorithms for the guillotine strip cutting/packing problem.
- Exact algorithms for the two-dimensional guillotine knapsack
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Multi-dimensional bin packing problems with guillotine constraints
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Optimal two-dimensional layout of industrial facilities
- Reactive GRASP for the strip-packing problem
- Three-dimensional bin packing problem with variable bin height
- Three-dimensional packings with rotations
Cited in
(12)- Instance space analysis for 2D bin packing mathematical models
- Exact solution techniques for two-dimensional cutting and packing
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Resource-constrained scheduling with non-constant capacity and non-regular activities
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
- Combinatorial Benders' cuts for the strip packing problem
- Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation
- scientific article; zbMATH DE number 5494075 (Why is no real title available?)
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- Mathematical models for the berth allocation problem in dry bulk terminals
This page was built for publication: Scheduling inspired models for two-dimensional packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421612)
