Solving Assembly Line Balancing Problems by Combining IP and CP

TL;DR

This paper introduces a hybrid method combining constraint programming and integer programming to effectively solve assembly line balancing problems, optimizing task distribution across stations.

Contribution

The paper proposes a novel hybrid approach that integrates IP and CP techniques for improved assembly line balancing solutions.

Findings

Enhanced solution quality compared to traditional methods

Reduced computational time for large instances

Demonstrated effectiveness on benchmark problems

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.