A strong cutting plane algorithm for the robotic assembly line balancing problem
From MaRDI portal
Publication:4399053
DOI10.1080/00207549508904817zbMath0914.90142OpenAlexW1983533679MaRDI QIDQ4399053
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
Related Items (8)
A classification of assembly line balancing problems ⋮ Balancing a robotic spot welding manufacturing line: an industrial case study ⋮ Reduction approaches for a generalized line balancing problem ⋮ Robotic disassembly line balancing problem: a mathematical model and ant colony optimization approach ⋮ \texttt{Absalom}: balancing assembly lines with assignment restrictions ⋮ 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
This page was built for publication: A strong cutting plane algorithm for the robotic assembly line balancing problem