A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates

DOI10.1016/j.ejor.2017.10.046zbMath1403.90486arXiv1703.07244OpenAlexW2604124474MaRDI QIDQ1754152

Rym M'Hallah, Sergey Polyakovskiy

Publication date: 30 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.07244

zbMATH Keywords

cuttingbatch schedulingtwo-dimensional bin packinglookahead searchpacking heuristic

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (7)

Single workgroup scheduling problem with variable processing personnel ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing ⋮ Integrated optimization of mixed cargo packing and cargo location assignment in automated storage and retrieval systems

Uses Software

• CPLEX
• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Unnamed Item
• New approximability results for two-dimensional bin packing
• A combinatorial Benders' decomposition for the lock scheduling problem
• Recent advances on two-dimensional bin packing problems
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• The one-dimensional cutting stock problem with due dates
• An analytical model for the container loading problem
• A lower bound for the non-oriented two-dimensional bin packing problem
• A new constraint programming approach for the orthogonal packing problem
• A new lower bound for the non-oriented two-dimensional bin-packing problem
• Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Multi-job Cutting Stock Problem with Due Dates and Release Dates
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Failure-Directed Search for Constraint-Based Scheduling

This page was built for publication: A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates