Solving Assembly Line Balancing Problems by Combining IP and CP
Alexander Bockmayr, Nicolai Pisaruk
Abstract
Assembly line balancing problems consist in partitioning the work necessary to assemble a number of products among different stations of an assembly line. We present a hybrid approach for solving such problems, which combines constraint programming and integer programming.
Create a lesson
Related papers
Equitable Subpartitionability Does Not Characterize Box-TDI Polyhedra
Emiliano Lancini, Francesco Pisanu
Detection and Construction of Small Blocking Sets via Critical Independent Sets and Matching Decomposition
Quanlong Niu, Riheng Jia
Maximal Linear Arrangement is NP complete on Bipartite Graphs
Aparna Das, Jonathan Needleman
Counting Polyominoes, Revisited: Corrigendum and Addendum
Gill Barequet, Gil Ben-Shachar
Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation
Anand Babu N B, Ashwin Jacob, Manjusha M S et al.
An upper bound of 4.268 for the random 3-SAT satisfiability threshold
Fedor Vorobyev