Solving Assembly Line Balancing Problems by Combining IP and CP

2001/06/01 by Alexander Bockmayr, Bockmayr, Alexander, Nicolai Pisaruk +1
Computer Science · Engineering · #Assembly Line Balancing Optimization #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #I.2.8 #Manufacturing Process and Optimization #Scheduling and Optimization Algorithms #cs.DM

paper · pdf · doi:10.48550/arxiv.cs/0106002

10 pages, Sixth Annual Workshop of the ERCIM Working Group on Constraints, Prague, June 2001

openalex publication_date 2001/06/01 · arxiv created 2001/08/21 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Improved integer programming models for simple assembly line balancing and related problems
• Domain-Independent Dynamic Programming and Constraint Programming Approaches for Assembly Line Balancing Problems with Setups
• Assembly line balancing with task division
• A branch, price and remember algorithm for the U shaped assembly line balancing problem
• A Receding Horizon Control For General Assembly Line Balancing Problems