Offline green bin packing and its constrained variant
Mingyang Gong, Brendan Mumey

TL;DR
This paper introduces the green bin packing problem, incorporating energy consumption into bin packing, and provides approximation algorithms and schemes for both the unconstrained and constrained variants.
Contribution
It formulates the green bin packing and constrained variants, and develops an APTAS and a 3/2-approximation algorithm for both, matching the lower bound of classical bin packing.
Findings
Developed an APTAS for GBP and CGBP.
Designed a 3/2-approximation algorithm for GBP and CGBP.
Achieved approximation ratios that match the classical bin packing lower bound.
Abstract
In this paper, we study the {\em green bin packing} (GBP) problem where and are two given values as part of the input. The energy consumed by a bin is where is the total size of the items packed into the bin. The GBP aims to pack all items into a set of unit-capacity bins so that the number of bins used plus the total energy consumption is minimized. When or , GBP is reduced to the classic bin packing (BP) problem. In the {\em constrained green bin packing} (CGBP) problem, the objective is to minimize the number of bins used to pack all items while the total energy consumption does not exceed a given upper bound . We present an APTAS and a -approximation algorithm for both GBP and CGBP, where the ratio matches the lower bound of BP. Keywords: Green bin packing; constrained green bin…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · Complexity and Algorithms in Graphs · Sustainable Supply Chain Management
