Skip to main content
Log in

A mathematical model and ant colony algorithm for multi-manned assembly line balancing problem

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

Abstract

In real-world assembly lines, that the size of the product is large (e.g., automotive industry), usually there are multi-manned workstations where a group of workers simultaneously perform different operations on the same individual product. This paper presents a mixed integer programming model to solve the balancing problem of the multi-manned assembly lines optimally. This model minimizes the total number of workers on the line as the first objective and the number of opened multi-manned workstations as the second one. Since this problem is well known as NP (nondeterministic polynomial-time)-hard, a heuristic approach based on the ant colony optimization approach is developed to solve the medium- and large-size scales of this problem. In the proposed algorithm, each ant tries to allocate given tasks to multi-manned workstations in order to build a balancing solution for the assembly line balancing problems by considering the precedence relations, multi-manned assembly line configuration, task times, and cycle time constraints. Through computational experiments, the performance of the proposed ACO is compared with some existing heuristic on various problem instances. The experimental results validate the effectiveness and efficiency of the proposed algorithm.

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

  1. Boysen N, Fliedner M, Scholl A (2007) A classification of assembly line balancing problems. Eur J Oper Res 183:674–693

    Article  MATH  Google Scholar 

  2. Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168:694–715

    Article  MathSciNet  MATH  Google Scholar 

  3. 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

    Article  MathSciNet  MATH  Google Scholar 

  4. Dimitriadis SG (2006) Assembly line balancing and group working: a heuristic procedure for workers’ groups operating on the same product and workstation. Comput Oper Res 33:2757–2774

    Article  MATH  Google Scholar 

  5. Bartholdi JJ (1993) Balancing two-sided assembly lines: a case study. Int J Prod Res 31:2447–2461

    Article  Google Scholar 

  6. McMullen PR, GV FRAZIER (1998) Using simulated annealing to solve a multi-objective assembly line balancing problem with parallel workstations. Int J Prod Res 36:2717–2741

    Article  MATH  Google Scholar 

  7. McMullen PR, Tarasewich P (2006) Multi-objective assembly line balancing via a modified ant colony optimization technique. Int J Prod Res 44:27–42

    Article  MATH  Google Scholar 

  8. Bukchin J, Masin M (2004) Multi-objective design of team-oriented assembly systems. Eur J Oper Res 156:326–352

    Article  MATH  Google Scholar 

  9. Cevikcan E, Durmusoglu BM, Unal ME (2009) A team-oriented design methodology for mixed model assembly systems. Comput Ind Eng 56:576–599

    Article  Google Scholar 

  10. Kim YK, Song WS, Kim JH (2009) A mathematical model and a genetic algorithm for two-sided assembly line balancing. Comput Oper Res 36:853–865

    Article  MATH  Google Scholar 

  11. Deckro RF (1989) Balancing cycle time and workstations. IIE Trans 21:106–11

    Article  Google Scholar 

  12. Ege Y, Azizoglu M, Ozdemirel NE (2009) Assembly line balancing with station paralleling. Comput Ind Eng. doi:10.1016/j.cie.2009.05.014

  13. Yeh DH, Kao HH (2009) A new bidirectional heuristic for the assembly line balancing problem. Comput Ind Eng. doi:10.1016/j.cie.2009.05.004

  14. Kirkpatrick S, Gelatt CD, Veechi MP (1983) Optimization by simulated annealing. Science 220:671–679

    Article  MathSciNet  Google Scholar 

  15. Glover F (1990) Tabu search: a tutorial. Interfaces 20:74–94

    Article  Google Scholar 

  16. Goldberg DE (1989) Genetic algorithms in search. Opti Mach Learn 36:2717–2741

    Google Scholar 

  17. Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern 26:29–41

    Article  Google Scholar 

  18. Bonabeau E, Dorigo M, Theraulaz G (1999) From natural to artificial swarm intelligence. Oxford University Press

  19. Maniezzo V, Gambardella LM, Luigi FD (2004) Ant colony optimization. In: Onwubolu GC, Babu BV (eds) New optimization techniques in engineering. Springer, Berlin, pp 101–117

    Google Scholar 

  20. Helgeson WB, Brine DP (1961) Assembly line balancing using ranked positional weight technique. J Ind Eng 12:394–398

    Google Scholar 

  21. Simaria AS, Vilarinho PM (2009) 2-ANTBAL: an ant colony optimization algorithm for balancing two-sided assembly lines. Comput Ind Eng 56:489–506

    Article  Google Scholar 

  22. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53–66

    Article  Google Scholar 

  23. Baykasoglu A, Dereli T (2006) Two-sided assembly line balancing using an ant-colony-based heuristic. Int J Adv Manuf Technol 36:582–588

    Article  Google Scholar 

  24. Talbot FB, Patterson JH (1984) An integer programming algorithm with network cuts solving the assembly line balancing problem. Manage Sci 30:85–89

    Article  MATH  Google Scholar 

  25. Mitchell J (1957) A computational procedure for balancing zoned assembly lines. Research Report 6-94801-1-R3. Westinghouse Research Laboratories, Pittsburgh

    Google Scholar 

  26. Sawyer JFH (1970) Line balancing. Machinery and Allied Products Institute, Washington, DC

    Google Scholar 

  27. Kilbridge MD, Wester L (1961) A heuristic method of assembly line balancing. J Ind Eng 12:292–298

    Google Scholar 

  28. Merten P (1967) Assembly line balancing by partial enumeration. Ablauf- und planungsforschung, 429-433

  29. Bowman EH (1960) Assembly line balancing by linear programming. Oper Res 8:385–389

    Article  MATH  Google Scholar 

  30. Jaeschke G (1964) Eine allgemaine Methode Zur Losung Kombinatoriiicher Probleme. Ablauf-Plan Forsch 5:133–153

    Google Scholar 

  31. Jackson JR (1956) A computing procedure for a line balancing problem. Manage Sci 2:261–272

    Article  Google Scholar 

  32. Mansoor EM (1964) Assembly line balancing-An Improvement on the Ranked Positional Weight Technique. J Ind Eng 15:73–77

    Google Scholar 

  33. Heskiaoff H (1968) A heuristic method for balancing assembly lines. West Electr Eng 12:9–16

    Google Scholar 

  34. Tonge FM (1961) A heuristic program of assembly line balancing. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  35. Arcus AL (1963) An analysis of a computer method of sequencing assembly line operations. Ph.D. Dissertation, University of California

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Parviz Fattahi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fattahi, P., Roshani, A. & Roshani, A. A mathematical model and ant colony algorithm for multi-manned assembly line balancing problem. Int J Adv Manuf Technol 53, 363–378 (2011). https://doi.org/10.1007/s00170-010-2832-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-010-2832-y

Keywords

Navigation