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.Comment: 10 pages, Sixth Annual Workshop of the ERCIM Working Group on
  Constraints, Prague, June 200

Bockmayr, Alexander

Pisaruk, Nicolai

English

arXiv

Colloque avec actes et comité de lecture. internationale.International audienceAssembly 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

Solving Assembly Line Balancing Problems by Combining IP and CP

Abstract

Similar works

Full text

Available Versions

INRIA a CCSD electronic archive server