Abstract
Bin Packing (BP) problem is one kind of typical combinatorial optimization problems concerned about packing a certain amount of different items into the minimal number of bins under specific constraints. In this paper, an organizational model called Garbage Can Model (GCM) is adopted to deal with a relaxed online BP problems. In GCM, the organizational structure and fluidities of problems and resources provide many optimization and re-combination opportunities for arriving items in stream. Different from traditional online BP algorithms, which usually result in a less-optimal solution in pursuing an extremely online executing speed, GCM-based algorithm achieves finding a bounded optimal solution for a relaxed online BP in a reactive fashion through seeking for a solution as optimal as possible as far as the time is allowed.
