S = {w_1, ..., w_n}
for each bin j do
    Solve the knapsack problem on bin j and save the result on OPT[j]
    \ OPT[j] is the set of items packed into bin j.
    Update S by removing the items in OPT[j]
    \ S = S - OPT[j]
    if S is empty do
        break