Number of bins and maximum lateness minimization in two-dimensional bin packing

DOI10.1016/J.EJOR.2020.09.023MaRDI QIDQ2029951zbMATH OpenOpenAlexFDO

Authors Claudio Arbib, Fabrizio Marinelli, Andrea Pizzuti

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

zbMATH Keywords

heuristicsmulti-objective problemspackingscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• 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
• Two-dimensional packing problems: a survey
• Sequential heuristic for the two-dimensional bin-packing problem
• Two-dimensional bin packing problems

Cites work

• 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
• A note on worst-case performance of heuristics for maintenance scheduling problems
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
• An improved typology of cutting and packing problems
• Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• scientific article; zbMATH DE number 2209474 (Why is no real title available?)
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Packing Rectangles into 2OPT Bins Using Rotations
• Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
• Recent advances on two-dimensional bin packing problems
• Scheduling a single batch processing machine with non-identical job sizes
• Sequential heuristic for the two-dimensional bin-packing problem
• Setup and open-stacks minimization in one-dimensional stock cutting
• The one-dimensional cutting stock problem with due dates
• Two for One: Tight Approximation of 2D Bin Packing
• Two-Dimensional Finite Bin-Packing Algorithms

Cited in

(13)

• 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 single machine scheduling problem with two-dimensional vector packing constraints
• Relations between capacity utilization, minimal bin size and bin number
• One-dimensional stock cutting resilient against singular random defects
• Tighter bounds for the harmonic bin packing algorithm
• Models for two-dimensional bin packing problems with customer order spread
• Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
• One-dimensional bin packing with pattern-dependent processing time
• A new branch-and-cut approach for integrated planning in additive manufacturing
• Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing
• A multi-objective evolutionary algorithm based on incremental support vector regression for the irregular strip packing problem
• An exact method for storage space assignment at airport cargo terminal: a temporal-spatial packing problem

This page was built for publication: Number of bins and maximum lateness minimization in two-dimensional bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029951)