English

Solving Assembly Line Balancing Problems by Combining IP and CP

Discrete Mathematics 2007-05-23 v2

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.

Cite

@article{arxiv.cs/0106002,
  title  = {Solving Assembly Line Balancing Problems by Combining IP and CP},
  author = {Alexander Bockmayr and Nicolai Pisaruk},
  journal= {arXiv preprint arXiv:cs/0106002},
  year   = {2007}
}

Comments

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