A strong cutting plane algorithm for the robotic assembly line balancing problem
Authors:
- 1 August 1995
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 33 (8) , 2311-2323
Abstract
We consider the problem of assigning assembly tasks, parts and tools on a serial robotic assembly line so that the total number of robot cells required is minimized while satisfying the various constraints. In this problem, we need to consider the limited space to store the parts and the tool capacity of the robot hand in addition to the precedence restriction between tasks and cycle time requirements usually found in the simple assembly line balancing problem. We give an integer programming formulation of this problem and a strong cutting plane algorithm to solve it. Computational experiences on some real world problems and randomly generated problems are reported.Keywords
This publication has 10 references indexed in Scilit:
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problemComputers & Operations Research, 1990
- Integer and Combinatorial Optimization1988
- Optimally Balancing Large Assembly Lines with “Fable”Management Science, 1988
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing ProblemManagement Science, 1986
- A Comparative Evaluation of Heuristic Line Balancing TechniquesManagement Science, 1986
- An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing ProblemManagement Science, 1984
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Assembly-Line Balancing by Linear ProgrammingOperations Research, 1960
- A Computing Procedure for a Line Balancing ProblemManagement Science, 1956