A strong cutting plane algorithm for the robotic assembly line balancing problem

DOI10.1080/00207549508904817zbMath0914.90142MaRDI QIDQ4399053

Sehie Park, Hoonjoo Kim

Publication date: 1 June 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549508904817

zbMATH Keywords

strong cutting plane algorithm; serial robotic assembly line

Mathematics Subject Classification ID

90C10: Integer programming

90B30: Production models

Related Items

\texttt{Absalom}: balancing assembly lines with assignment restrictions, A classification of assembly line balancing problems, A survey on problems and methods in generalized assembly line balancing, Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds, A genetic algorithm for robotic assembly line balancing

Cites Work

• Unnamed Item
• A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
• Assembly-Line Balancing by Linear Programming
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Solving Large-Scale Zero-One Linear Programming Problems
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem