Assembly System Design: A Branch and Cut Approach
From MaRDI portal
Publication:2783918
DOI10.1287/mnsc.44.1.103zbMath0989.90049OpenAlexW2101645800MaRDI QIDQ2783918
Anulark Pinnoi, Wilbert E. Wilhelm
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/07f4b9a45c5494298b208f6c85e6e77eed37d187
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30)
Related Items
A classification of assembly line balancing problems, Optimally balancing assembly lines with different workstations, A versatile algorithm for assembly line balancing, Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled, On solving the assembly line worker assignment and balancing problem via beam search, Optimizing glass coating lines: MIP model and valid inequalities, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, A survey on problems and methods in generalized assembly line balancing, Valid inequalities for a class of assembly system problems