Constraint programming for solving various assembly line balancing problems

•Constraint programming (CP) is presented as modeling and solution approach for various assembly line balancing problems.•CP is demonstrated as generic and efficient modeling language for generalized assembly line design/balancing problems.•Performance evaluation shows that CP dominates MILP in most...

Full description

Bibliographic Details

Published in:	Omega (Oxford) Vol. 78; pp. 57 - 68
Main Authors:	Bukchin, Yossi, Raviv, Tal
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.07.2018
Subjects:	Assembly line balancing Branch & bound (B&B) Constraint programming (CP) Mixed-integer linear programming (MILP) Constraint programming (CP) Assembly line balancing Branch & bound (B&B) Mixed-integer linear programming (MILP)
ISSN:	0305-0483, 1873-5274
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!