Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time

This paper is focused on the solution quality and computing time requirements of heuristic methods for cost-oriented assembly line balancing. It is based on a recent paper by Amen, which describes in detail the solution process of existent and two new heuristics. After a short review of the historic origin and the wideness of assembly line systems in present day industry, the paper emphasizes the economic view of production in order to cut down production cost. Results of a worst-case analysis concerning the solution quality and the computing time are presented. An interval for the worst-case-solution quality for most heuristic methods is given. The results of an experimental investigation show that the new priority rule ‘best change of idle cost’ (Amen) achieves significantly better solutions than the existent priority rules. Furthermore, the new method ‘exact solution of sliding problem windows’ has been found to be the best heuristic method known so far.