Procedures for the bin packing problem with precedence constraints
The bin packing problem with precedence constraints is investigated. Its relationship with the assembly line balancing problem is considered. New dominance rules and lower bounds are developed. A dynamic programming based heuristic and a branch-and-bound method are proposed. The results show that the methods outperforms all previous approaches.
bin packing precedence constraints lower bounds dynamic programming branch-and-bound