We consider the FIFO Stack-Up problem which arises in delivery industry, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences q1, . . . , qk of labeled bins and a positive integer p. The goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places. Each of these pallets h...