Online packing of arbitrary sized items into designated and multipurpose bins

DOI10.1016/j.ejor.2019.05.029zbMath1430.90375OpenAlexW2947262873MaRDI QIDQ2001455

Noam Goldberg, Shlomo Karhi

Publication date: 3 July 2019

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.05.029

zbMATH Keywords

online algorithmsbin packingcontainer shippingcompetitive ratio analysistype compatibility

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Cold chain transportation decision in the vaccine supply chain

Cites Work

• Unnamed Item
• Unnamed Item
• On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
• Vector bin packing with multiple-choice
• Online variable-sized bin packing
• Algorithms for the variable sized bin packing problem
• Online results for black and white bin packing
• The class constrained bin packing problem with applications to video-on-demand
• Cross-Utilization of Workers Whose Capabilities Differ
• Online Colored Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Online and dynamic algorithms for set cover
• Multiple subset sum with inclusive assignment set restrictions
• The optimal absolute ratio for online bin packing
• Tight bounds for online vector bin packing

This page was built for publication: Online packing of arbitrary sized items into designated and multipurpose bins