Number of bins and maximum lateness minimization in two-dimensional bin packing
From MaRDI portal
Publication:2029951
DOI10.1016/j.ejor.2020.09.023zbMath1487.90539OpenAlexW3090785372MaRDI QIDQ2029951
Andrea Pizzuti, Fabrizio Marinelli, Claudio Arbib
Publication date: 4 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.09.023
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Recent advances on two-dimensional bin packing problems
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
- The one-dimensional cutting stock problem with due dates
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- Sequential heuristic for the two-dimensional bin-packing problem
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
- An improved typology of cutting and packing problems
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- Two for One: Tight Approximation of 2D Bin Packing
- Packing Rectangles into 2OPT Bins Using Rotations
- Two-Dimensional Finite Bin-Packing Algorithms
- Scheduling a single batch processing machine with non-identical job sizes
- 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: Number of bins and maximum lateness minimization in two-dimensional bin packing
