Skip to main content
SpringerLink
Log in

A tabu search algorithm for two-sided assembly line balancing

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Two-sided assembly lines are often used at the assembly of large-sized high-volume products, such as cars, trucks, and buses. In this type of a production line, the left side and the right side of the line are used in parallel. This paper presents a tabu search algorithm for two-sided assembly line balancing. The line efficiency and the smoothness index are considered as the performance criteria. The proposed algorithm is illustrated with two numerical example problems, and its performance is tested on a set of test problems taken from literature. The performance of the proposed algorithm is compared to the existing approaches. The computational results show that the proposed algorithm performs well.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Scholl A, Klein R (1999) ULINO: optimally balancing U-shaped JIT assembly lines. Int J Prod Res 37(4):721–736. doi:10.1080/002075499191481

    Article  MATH  Google Scholar 

  2. Boysen N, Fliedner M, Scholl A (2007) A classification of assembly line balancing problems. Eur J Oper Res 183:674–693. doi:10.1016/j.ejor.2006.10.010

    Article  MATH  Google Scholar 

  3. Baybars I (1986) A survey of exact algorithms for the simple line balancing problem. Manage Sci 32:909–932

    Article  MATH  MathSciNet  Google Scholar 

  4. Ghosh S, Gagnon RJ (1989) A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems. Int J Prod Res 27(4):637–670. doi:10.1080/00207548908942574

    Article  Google Scholar 

  5. Erel E, Sarin SC (1998) A survey of the assembly line balancing procedures. Prod Plan Control 9:414–434. doi:10.1080/095372898233902

    Article  Google Scholar 

  6. Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168:666–693. doi:10.1016/j.ejor.2004.07.022

    Article  MATH  MathSciNet  Google Scholar 

  7. Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168:694–715. doi:10.1016/j.ejor.2004.07.023

    Article  MATH  MathSciNet  Google Scholar 

  8. Lee TO, Kim Y, Kim YK (2001) Two-sided assembly line balancing to maximize work relatedness and slackness. Comput Ind Eng 40(3):273–292. doi:10.1016/S0360-8352(01)00029-8

    Article  Google Scholar 

  9. Bartholdi JJ (1993) Balancing two-sided assembly lines: a case study. Int J Prod Res 31(10):2447–2461. doi:10.1080/00207549308956868

    Article  Google Scholar 

  10. Kim YK, Kim Y, Kim YJ (2000) Two-sided assembly line balancing: a genetic algorithm approach. Prod Plan Control 11(1):44–53. doi:10.1080/095372800232478

    Article  Google Scholar 

  11. Ajenblit DA, Wainwright RL (1998) Applying genetic algorithms to the U-shaped assembly line balancing problem. Proceedings of the 1998 IEEE international conference on evolutionary computation. Anchorage, Alaska, pp 96–101

  12. Salveson ME (1955) The assembly line balancing problem. J Ind Eng 6:18–25

    Google Scholar 

  13. Baykasoglu A, Dereli T (2008) Two-sided assembly line balancing using an ant-colony-based heuristic. Int J Adv Manuf Technol 36(5–6):582–588. doi:10.1007/s00170-006-0861-3

    Article  Google Scholar 

  14. Hu X, Erfei W, Ye J (2008) A station-oriented enumerative algorithm for two-sided assembly line balancing. Eur J Oper Res 186:435–440. doi:10.1016/j.ejor.2007.01.022

    Article  MATH  Google Scholar 

  15. Glover F (1989) Tabu search, part I. ORSA J Comput 1:190–206

    MATH  MathSciNet  Google Scholar 

  16. Glover F (1989) Tabu search, part II. ORSA J Comput 2:4–32

    MathSciNet  Google Scholar 

  17. Taillard E (1990) Some efficient heuristic methods for flow shop sequencing problem. Eur J Oper Res 47:65–74. doi:10.1016/0377-2217(90)90090-X

    Article  MATH  MathSciNet  Google Scholar 

  18. Glover F, Laguna M (1993) Tabu search. In: Reeves CR (ed) Modern heuristic techniques for combinatorial problems. Blackwell, London, Edinburgh, Boston, Melbourne, Paris, Berlin, Wien

    Google Scholar 

  19. Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Boston, Dordrecht, London

    MATH  Google Scholar 

  20. Gendreau M (2003) An introduction to tabu search. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic, Boston, Dordrecht, London

    Google Scholar 

  21. Scholl A, Vo S (1996) Simple assembly line balancing-heuristic approaches. J Heuristics 2:217–244. doi:10.1007/BF00127358

    Article  Google Scholar 

  22. Chiang WC (1998) The application of a tabu search metaheuristic to the assembly line balancing problem. Ann Oper Res 77:209–227. doi:10.1023/A:1018925411397

    Article  MATH  MathSciNet  Google Scholar 

  23. Lapierre SD, Ruiz A, Soriano P (2006) Balancing assembly lines with tabu search. Eur J Oper Res 168:826–837. doi:10.1016/j.ejor.2004.07.031

    Article  MATH  MathSciNet  Google Scholar 

  24. Boctor FF (1995) A multiple-rule heuristic for assembly line balancing. J Oper Res Soc 46:62–69

    Article  MATH  Google Scholar 

  25. Ponnambalam SG, Aravindan P, Naidu GM (2000) A multi-objective genetic algorithm for solving assembly line balancing problem. Int J Adv Manuf Technol 16:341–352. doi:10.1007/s001700050166

    Article  Google Scholar 

  26. Baykasoğlu A (2006) Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems. J Intell Manuf 17:217–232. doi:10.1007/s10845-005-6638-y

    Article  Google Scholar 

  27. Tabucanon MT (1988) Multiple criteria decision making in industry (studies in production and engineering economics, 8). Elsevier, Amsterdam–Oxford–New York–Tokyo

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Selçuk University, 42075, Selçuklu, Konya, Turkey

    Uğur Özcan

  2. Department of Industrial Engineering, Gazi University, 06570, Maltepe, Ankara, Turkey

    Bilal Toklu

Authors
  1. Uğur Özcan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bilal Toklu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Uğur Özcan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Özcan, U., Toklu, B. A tabu search algorithm for two-sided assembly line balancing. Int J Adv Manuf Technol 43, 822–829 (2009). https://doi.org/10.1007/s00170-008-1753-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1753-5

Keywords

Search

Navigation