A survey of exact algorithms for the simple assembly line balancing problem
Management Science
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Eureka: a hybrid system for assembly line balancing
Management Science
Heuristics and lower bounds for the bin packing problem with conflicts
Computers and Operations Research
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
Computers and Operations Research
New bin packing fast lower bounds
Computers and Operations Research
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
Operations Research
Strip packing with precedence constraints and strip packing with release times
Theoretical Computer Science
Algorithms for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
Fast lifting procedures for the bin packing problem
Discrete Optimization
Mathematical programming algorithms for bin packing problems with item fragmentation
Computers and Operations Research
| Hi-index | 0.00 |
Given a set of identical capacitated bins, a set of weighted items, and a set of precedences among such items, we are interested in determining the minimum number of bins that can accommodate all items and can be ordered in such a way that all precedences are satisfied. The problem, denoted as the bin packing problem with precedence constraints BPP-P, has a very intriguing combinatorial structure and models many assembly and scheduling issues. According to our knowledge, the BPP-P has received little attention in the literature, and in this paper we address it for the first time with exact solution methods. In particular, we develop reduction criteria, a large set of lower bounds, a variable neighborhood search upper bounding technique, and a branch-and-bound algorithm. We show the effectiveness of the proposed algorithms by means of extensive computational tests on benchmark instances and comparison with standard integer linear programming techniques.