AN IMPROVED HEURISTIC ALGORITHM FOR THE ASSEMBLY LINE BALANCING PROBLEM

摘要

The assembly line balancing problem is the problem of assigning tasks to workstations. The main objective of the assignment is minimized total idle time under the process constraints. Because it is a NP hard problem, to develop an efficient heuristics is very important. In this paper, an improved heuristic algorithm is introduced. It combines the advantages of RPW and Branch and Bound, while using the optimizing idea in the Operational Research and the Cybernetics to improve the solution. At last an example is given for illustration.