Skip to main content
Log in

A comparison of heuristic algorithms for cost-oriented assembly line balancing

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

Two new heuristic algorithms for solving cost-oriented assembly line balancing problems -the Wage-Rate-Method (WR) and the Wage-Rate-Smoothing-Method (WRS) — are presented and compared with two known heuristics — the Positional-Weight-Method (PW) and the Positional-Weight-Wage-Rate-Difference-Method (PWWD) with respect to their solution qualities. Firstly, the heuristics are outlined and their computational effort is stated. Then, a theoretical worst-case bound for the solution quality is given and the results of an extensive performance study are reported. In the study the heuristics were investigated with respect to their solution quality by solving randomly generated line balancing problems and problems from literature. It can be concluded that PWWD and WRS are generally superior to PW and WR.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Coffman EG, Garey MR, Johnson DS, Tarjan RE (1980) Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms. SIAM J Comput 9:808–826

    Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco

    Google Scholar 

  • Garey MR, Johnson DS (1981) Approximation Algorithms for Bin Packing Problems: A Survey. In: Ausiello G, Lucertini M (Eds) Analysis and Design of Algorithms in Combinatorial Optimization. Springer, Wien New York, pp 147–172

    Google Scholar 

  • Hahn R (1972) Produktionsplanung bei Linienfertigung. de Gruyter, Berlin New York

    Google Scholar 

  • Helgeson WB, Birnie DP (1961) Assembly Line Balancing Using the Ranked Positional Weight Technique. J Indust Eng 12:394–398

    Google Scholar 

  • Jackson JR (1956) A Computing Procedure for a Line Balancing Problem. Managem Sci 2:261–271

    Google Scholar 

  • Johnson RV (1981) Assembly Line Balancing Algorithms: Computational Comparisons. Intern J Prod Res 19:277–287

    Google Scholar 

  • Kilbridge MD, Wester L (1962) A Review of Analytical Systems of Line Balancing. Operat Res 10:626–638

    Google Scholar 

  • Lutz L (1974) Abtakten von Montagelinien. Krausskopf, Mainz

    Google Scholar 

  • Steffen R (1977) Produktionsplanung bei Fließbandfertigung. Gabler, Wiesbaden

    Google Scholar 

  • Tabucanon MT, Somnasang S (1981) Line Balancing in an Automobile Assembly Plant: Comparative Applications of Two Techniques. Indust Management 23:18–23

    Google Scholar 

  • Talbot FB, Patterson JH, Gehrlein WV (1986) A Comparative Evaluation of Heuristic Line Balancing Techniques. Managern Sci 32:430–454

    Google Scholar 

  • Wee TS, Magazine MJ (1982) Assembly Line Balancing as Generalized Bin Packing. Operat Res Lett 1:56–58

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Parts of this research have been supported by the Stiftung Industrieforschung.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rosenberg, O., Ziegler, H. A comparison of heuristic algorithms for cost-oriented assembly line balancing. ZOR - Methods and Models of Operations Research 36, 477–495 (1992). https://doi.org/10.1007/BF01416240

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01416240

Key words

Navigation