Online interval coloring with packing constraints
Theoretical Computer Science
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
Information Processing Letters
Theoretical Computer Science
Integrated Production and Delivery Scheduling with Disjoint Windows
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
On Lazy Bin Covering and Packing problems
Theoretical Computer Science
Integrated production and delivery scheduling with disjoint windows
Discrete Applied Mathematics
A global search framework for practical three-dimensional packing with variable carton orientations
Computers and Operations Research
On lazy bin covering and packing problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Online interval coloring with packing constraints
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Comparing online algorithms for bin packing problems
Journal of Scheduling
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
We study a variant of the classical bin-packing problem, the ordered open-end bin-packing problem, where first a bin can be filled to a level above 1 as long as the removal of the last piece brings the bin's level back to below 1 and second, the last piece is the largest-indexed piece among all pieces in the bin. We conduct both worst-case and average-case analyses for the problem. In the worst-case analysis, pieces of size 1 play distinct roles and render the analysis more difficult with their presence. We give lower bounds for the performance ratio of any online algorithm for cases both with and without the 1-pieces, and in the case without the 1-pieces, identify an online algorithm whose worst-case performance ratio is less than 2 and an offline algorithm with good worst-case performance. In the average-case analysis, assuming that pieces are independently and uniformly drawn from [0, 1], we find the optimal asymptotic average ratio of the number of occupied bins over the number of pieces. We also introduce other online algorithms and conduct simulation study on the average-case performances of all the proposed algorithms.