Generalized last open-end bin packing problem

DOI10.1007/978-981-95-4839-2_22MaRDI QIDQ7290085zbMATH OpenFDO

Authors Zhikang Zhang, Weidong Li

Publication date 6 July 2026

Full work available at URL https://doi.org/10.1007/978-981-95-4839-2_22

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A new and improved algorithm for online bin packing
• A new lower bound for classic online bin packing
• A note on a variant of the online open end bin packing problem
• A note on an open-end bin packing problem
• A sequential follower refinement algorithm for robust surgery scheduling
• An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
• Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
• Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
• Fast approximation methods for online scheduling of outpatient procedure centers
• Hardness of lazy packing and covering
• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
• Lower and upper bounding procedures for the bin packing problem with concave loading cost
• Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
• More on ordered open end bin packing
• On lazy bin covering and packing problems
• On the online bin packing problem
• Online bin packing with overload cost
• Open-end bin packing: new and old analysis approaches
• Parameterized on-line open-end bin packing
• Scheduling with a discounted profit criterion on identical machines
• The bin packing problem with precedence constraints
• The Ordered Open-End Bin-Packing Problem

This page was built for publication: Generalized last open-end bin packing problem

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