Solving Assembly Line Balancing Problems by Combining IP and CP

Simple item page
dc.creatorBockmayr, Alexander
dc.creatorPisaruk, Nicolai
dc.date2001-06-01
dc.date2001-08-21
dc.date.accessioned2026-07-07T03:17:11Z
dc.date.available2026-07-07T03:17:11Z
dc.descriptionAssembly 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.
dc.description10 pages, Sixth Annual Workshop of the ERCIM Working Group on Constraints, Prague, June 2001
dc.identifierhttps://arxiv.org/abs/cs/0106002
dc.identifierhttp://arxiv.org/abs/cs/0106002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30625
dc.subjectDiscrete Mathematics
dc.subjectF.2.2; I.2.8
dc.titleSolving Assembly Line Balancing Problems by Combining IP and CP
dc.typetext

Files

Collections

arXiv