Solving Assembly Line Balancing Problems by Combining IP and CP - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Solving Assembly Line Balancing Problems by Combining IP and CP

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.
Not file

Dates and versions

inria-00101101 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00101101 , version 1

Cite

Alexander Bockmayr, Nicolai Pisaruk. Solving Assembly Line Balancing Problems by Combining IP and CP. Sixth Annual Workshop of the ERCIM Working Groupon Constraints, 2001, Prague, Czech Republic, 10 p. ⟨inria-00101101⟩
41 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More