For one-dimensional bin packing problem, the optimal solution cannot be obtained by maximizing the fullness of each bin through setting the "value" equal to the "weight" in the 0-1 knapsack problem. Please see: Knapsack with multiple bags and items having only weight