Skip to main content
SpringerLink
Log in

The application of a tabu search metaheuristic to the assembly line balancing problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper describes the application of tabu search, a metaheuristic technique for optimization problems, to assembly line balancing problems. Four different versions of algorithms are developed. They all share the same tabu search strategy except that the first one uses the best improvement with task aggregation, the second one uses best improvement without task aggregation, the third one uses the first improvement with task aggregation, and the last one uses the first improvement without task aggregation. Computational experiments with these different search strategies have been performed for some assembly line problems from the open literature. The results show that tabu search performs extremely well. Except for a few cases, tabu search always finds optimal solutions.

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

Access this article

Log in via an institution

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

  1. E.J. Anderson and M.C. Ferris, Genetic algorithms for combinatorial optimization: The assembly line balancing problem, ORSA Journal on Computing 6(1994)161 - 173.

    Google Scholar 

  2. A.L. Arcus, An analysis of a computer method of sequencing assembly line operations, Ph.D. Dissertation, University of California, Berkeley, 1963.

  3. I. Berger, J.M. Bourjolly and G. Laporte, Branch-and-bound algorithm for the multi-product assembly line balancing problem, European Journal of Operational Research 58(1992)215 - 222.

    Google Scholar 

  4. F.F. Boctor, A multiple-rule heuristic for assembly line balancing, Journal of the Operational Research Society 46(1995)62 - 69.

    Google Scholar 

  5. E.H. Bowman, Assembly line balancing by linear programming, Operations Research 8(1960)385 - 389.

    Google Scholar 

  6. R.L. Carraway, A dynamic programming approach to stochastic assembly line balancing, Management Science 35(1989)459- 471.

    Google Scholar 

  7. W.-C. Chiang and P. Kouvelis, Simulated annealing and tabu search approaches for unidirectional flowpath design for Automated Guided Vehicle systems, Annals of Operations Research 50(1994).

  8. W.-C. Chiang and P. Kouvelis, An improved tabu search heuristic for solving facility layout design problems, International Journal of Production Research 34(1996)2565 - 2585.

    Google Scholar 

  9. W.-C. Chiang and R. Russell, A reactive tabu search metaheuristic for the vehicle routing problem with time windows, INFORMS Journal on Computing (1997) forthcoming.

  10. E.M. Dar-El, Assembly line balancing - an improvement on the ranked positional weight technique, Journal of Industrial Engineering 15(1964)73 - 77.

    Google Scholar 

  11. E.M. Dar-El, MALB - a heuristic technique for balancing large single-model assembly lines, AIIE Transactions 5(1973)343- 356.

    Google Scholar 

  12. E.M. Dar-El, Solving large single-model assembly line balancing problems - a comparative study, AIIE Transactions 7(1975)302 - 310.

    Google Scholar 

  13. F.F. Easton, A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem, Computers and Operations Research 17(1990)163 - 175.

    Google Scholar 

  14. F. Glover, Tabu search, Part I, ORSA Journal on Computing 1(1989)190 - 206.

    Google Scholar 

  15. F. Glover, Tabu search, Part II, ORSA Journal on Computing 2(1989)4 - 32.

    Google Scholar 

  16. F. Glover, Tabu search and adaptive memory programming - advances, applications, and challenges, in: Interfaces in Computer Science and Operations Research, Barr, Helgason and Kennington, eds., Kluwer Academic, 1996.

  17. F. Glover and M.M. Laguna, Tabu search, in: Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, ed., Halsted Press, New York, 1993.

    Google Scholar 

  18. J.R. Jackson, A computing procedure for a line balancing with a precedence matrix, Management Science 2(1956)261 - 272.

    Google Scholar 

  19. G. Jaeschke, Eine allgemeine Methode zur Lösung kombinatorischer Probleme, Ablauf-und Planungsforschung 5(1964)133 - 153.

    Google Scholar 

  20. R.V. Johnson, Optimally balancing large assembly lines with FABLE, Management Science 34 (1988)240 - 253.

    Google Scholar 

  21. M.D. Kilbridge and L. Wester, A heuristic method of assembly line balancing, Journal of Industrial Engineering 12(1961)292 - 298.

    Google Scholar 

  22. Y.Y. Leu, L.A. Matheson and L.P. Rees, Assembly line balancing using genetic algorithms with heuristic-generated initial populations and multiple evaluation criteria, Decision Sciences 25(1994) 581 - 606.

    Google Scholar 

  23. B. Malakooti and A. Kumar, A knowledge-based system for solving multi-objective assembly line balancing problems, International Journal of Production Research 34(1996)2533 - 2552.

    Google Scholar 

  24. A.A. Mastor, An experimental investigation and comparative evaluation of production line balancing techniques, Ph.D. Dissertation, University of California, Los Angeles, 1966.

  25. A.A. Mastor, An experimental investigation and comparative evaluation of production line balancing techniques, Management Science 16(1970)728 - 745.

    Google Scholar 

  26. P. Merten, Assembly line balancing by partial enumeration, Ablauf-und Planungforschung 8(1967)429- 433.

    Google Scholar 

  27. J. Rubinovitz and G. Levitin, Genetic algorithm for assembly line balancing, International Journal of Production Economics 41(1995)343 - 354.

    Google Scholar 

  28. M.E. Salverson, The assembly line balancing problem, Journal of Industrial Engineering 6(1955) 18 - 25.

    Google Scholar 

  29. J.F.H. Sawyer, Line Balancing, Machinery and Allied Products Institute, Washington, DC, 1970.

    Google Scholar 

  30. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA Journal on Computing 2(1990)33- 44.

    Google Scholar 

  31. D. Shin and H. Min, Flexible line balancing practices in a Just-In-Time environment, Production and Inventory Management Journal 32(1991)38–41.

    Google Scholar 

  32. D. Shin and H. Min, Uniform assembly line balancing with stochastic task times in Just-In-Time manufacturing, International Journal of Operations and Production Management 11(1991)23 - 34.

    Google Scholar 

  33. G. Suresh and S. Sahu, Stochastic assembly line balancing using simulated annealing, International Journal of Production Research 32(1994)1801 - 1810.

    Google Scholar 

  34. F.B. Talbot and J.H. Patterson, An interger programming algorithm with network cuts for solving the assembly line balancing problem, Management Science 30(1984)85 - 99.

    Google Scholar 

  35. F.M. Tonge, A Heuristic Program of Assembly Line Balancing, Prentice-Hall, Englewood Cliffs, NJ, 1961.

    Google Scholar 

  36. F.M. Tonge, Summary of a heuristic line balancing procedure, Management Science 7(1969)21 - 42.

    Google Scholar 

  37. S. Warshall, A theorem of a Boolean matrix, Journal of ACM 9(1962)11 - 12.

    Google Scholar 

Download references

Authors
  1. Wen-Chyuan Chiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chiang, WC. The application of a tabu search metaheuristic to the assembly line balancing problem. Annals of Operations Research 77, 209–227 (1998). https://doi.org/10.1023/A:1018925411397

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018925411397

Search

Navigation