A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
From MaRDI portal
Publication:1742194
DOI10.1016/j.endm.2018.01.004zbMath1392.90014OpenAlexW2789812716MaRDI QIDQ1742194
Andrea Pizzuti, Fabrizio Marinelli
Publication date: 11 April 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2018.01.004
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Single workgroup scheduling problem with variable processing personnel ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
Cites Work
- Recent advances on two-dimensional bin packing problems
- Lower bounds and reduction procedures for the bin packing problem
- The one-dimensional cutting stock problem with due dates
- A lower bound for the non-oriented two-dimensional bin packing problem
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- Sequential heuristic for the two-dimensional bin-packing problem
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
This page was built for publication: A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
