Balancing of mixed-model two-sided assembly lines with multiple U-shaped layout

  • Masoud Rabbani
  • Mohsen Moghaddam
  • Neda Manavizadeh
ORIGINAL ARTICLE
First Online:
Received:
Accepted:

Abstract

Two-sided assembly lines are a special type of assembly lines in which tasks are assigned to workstations placed on both sides of the assembly line. This type of assembly systems are used for manufacturing systems with large-sized product such as cars, buses, and trucks. According to the principles of just-in-time production, it is deduced that there are copious benefits associated with U-shaped assembly lines in comparison with traditional straight line system. Nevertheless, implementing U-shaped layouts in two-sided assembly lines do not significantly increase the efficiency and flexibility of the workstations placed outside of the U-shaped layout. Hence, a novel multiple U-shaped layout is proposed in this study to deal with the mixed-model two-sided assembly line balancing (MTALB) problems. A mixed integer programming formulation is developed to model such manufacturing systems in which two conflicting objectives including minimizing the cycle time and minimizing the number of workstations are considered under precedence, zoning, capacity, side, and synchronism constraints. Since MTALB problems are in NP-hard class of combinatorial optimization problems, a heuristic algorithm based on genetic algorithms is developed to solve the MTALB problem. Three test-bed problems are also used to prove the usefulness and applicability of the proposed framework.

Keywords

Two-sided assembly line Mixed-model production Multiple U-shaped layout Balancing Optimization Genetic algorithms 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rekiek B, Delchambre A (2005) Assembly line design: the balancing of mixed-model hybrid assembly lines with genetic algorithms. Springer series in advanced manufacturing, 1st edn. Springer, LondonGoogle Scholar
  2. 2.
    Henig MI (1986) Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems. Comput Oper Res 13(4):443–449MATHCrossRefGoogle Scholar
  3. 3.
    Saltzman MJ, Baybars I (1987) A two-process implicit enumeration algorithm for the simple assembly line balancing problem. Eur J Oper Res 32(1):118–129MATHCrossRefGoogle Scholar
  4. 4.
    Berger I, Bourjolly JM, Laporte G (1992) Branch-and-bound algorithms for the multi-product assembly line balancing problem. Eur J Oper Res 58(2):215–222MATHCrossRefGoogle Scholar
  5. 5.
    Sprechter A (1999) A competitive branch-and-bound algorithm for the simple assembly line balancing problem. Int J Prod Res 37(8):1787–1816CrossRefGoogle Scholar
  6. 6.
    Peeters M, Degraeve Z (2006) An linear programming based lower bound for the simple assembly line balancing problem. Eur J Oper Res 168(3):716–731MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Bukchin Y, Rabinowitch I (2006) A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs. Eur J Oper Res 174(1):492–508MATHCrossRefGoogle Scholar
  8. 8.
    Kilincci O, Bayhan GM (2006) A Petri net approach for simple assembly line balancing problems. Int J Adv Manuf Technol 30(11–12):1165–1173CrossRefGoogle Scholar
  9. 9.
    Kilincci O, Bayhan GM (2008) A P-invariant-based algorithm for simple assembly line balancing problem of type-1. Int J Adv Manuf Technol 37(3–4):400–409CrossRefGoogle Scholar
  10. 10.
    Boysen N, Fliedner M, Scholl A (2007) A classification of assembly line balancing problems. Eur J Oper Res 183(2):674–693MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Liu SB, Ng KM, Ong HL (2008) Branch-and-bound algorithms for simple assembly line balancing problem. Int J Adv Manuf Technol 36(1–2):169–177CrossRefGoogle Scholar
  12. 12.
    Bautista J, Pereira J (2009) A dynamic programming based heuristic for the assembly line balancing problem. Eur J Oper Res 194(3):787–794MATHCrossRefGoogle Scholar
  13. 13.
    Sabuncuoglu I, Erel E, Alp A (2009) Ant colony optimization for the single model U-type assembly line balancing problem. Int J Prod Econ 120(2):287–300CrossRefGoogle Scholar
  14. 14.
    Shin D (1990) An efficient heuristic for solving stochastic assembly line balancing problems. Comput Ind Eng 18(3):285–295CrossRefGoogle Scholar
  15. 15.
    Liu SB, Ong HL, Huang HC (2005) A bidirectional heuristic for stochastic assembly line balancing type II problem. Int J Adv Manuf Technol 25(1–2):71–77CrossRefGoogle Scholar
  16. 16.
    Gao J, Sun L, Wang L, Mitsuo Gen M (2009) An efficient approach for type II robotic assembly line balancing problems. Comput Ind Eng 56(3):1065–1080CrossRefGoogle Scholar
  17. 17.
    Sarin SC, Erel E, Dar-El EM (1999) A methodology for solving single-model, stochastic assembly line balancing problem. Omega 27(5):525–535CrossRefGoogle Scholar
  18. 18.
    Gamberini R, Grassi A, Rimini B (2006) A new multi-objective heuristic algorithm for solving the stochastic assembly line re-balancing problem. Int J Prod Econ 102(2):226–243CrossRefGoogle Scholar
  19. 19.
    Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168(3):694–715MathSciNetMATHCrossRefGoogle Scholar
  20. 20.
    Song BL, Wong WK, Fan JT, Chan SF (2006) A recursive operator allocation approach for assembly line-balancing optimization problem with the consideration of operator efficiency. Comput Ind Eng 51(4):585–608CrossRefGoogle Scholar
  21. 21.
    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–670CrossRefGoogle Scholar
  22. 22.
    Noorul Haq A, Jayaprakash J, Rengarajan K (2006) A hybrid genetic algorithm approach to mixed-model assembly line balancing. Int J Adv Manuf Technol 28(3–4):337–341CrossRefGoogle Scholar
  23. 23.
    Simaria AS, Vilarinho PM (2009) 2-ANTBAL: an ant colony optimization algorithm for balancing two-sided assembly lines. Comput Ind Eng 56(2):489–506CrossRefGoogle Scholar
  24. 24.
    Özcan U, Toklu B (2009) Balancing of mixed-model two-sided assembly lines. Comput Ind Eng 57(1):217–227CrossRefGoogle Scholar
  25. 25.
    Bartholdi JJ (1993) Balancing two-sided assembly lines: a case study. Int J Prod Res 31(10):2447–2461CrossRefGoogle Scholar
  26. 26.
    Kara Y, Paksoy T, Chang CT (2009) Binary fuzzy goal programming approach to single model straight and U-shaped assembly line balancing. Eur J Oper Res 195(2):335–347MathSciNetMATHCrossRefGoogle Scholar
  27. 27.
    Hwang R, Katayama H (2009) A multi-decision genetic approach for workload balancing of mixed-model U-shaped assembly line systems. Int J Prod Res 47(14):3797–3822CrossRefGoogle Scholar
  28. 28.
    Aigbedo H, Monden Y (1997) A parametric procedure for multi-criterion sequence scheduling for just-in-time mixed-model assembly lines. Int J Prod Res 35(9):2543–2564MATHCrossRefGoogle Scholar
  29. 29.
    Miltenburg J (1998) Balancing U-lines in a multiple U-line facility. Eur J Oper Res 109(1):1–23MATHCrossRefGoogle Scholar
  30. 30.
    Boysen N, Fliedner M, Scholl A (2008) Assembly line balancing: which model to use when? Int J Prod Econ 111(2):509–528CrossRefGoogle Scholar
  31. 31.
    Lebefromm U (1999) Produktionsmanagement—Einfuhrung mit Beispielen aus SAP R/3, 4th edn. Oldenbourg, MunchenGoogle Scholar
  32. 32.
    Grabau MR, Maurer RA (1998) Assembly line balancing when scarp impacts the bottom line. Prod Invent Manag J 39:16–21Google Scholar
  33. 33.
    Salveson ME (1955) The assembly line balancing problem. J Ind Eng 6(3):18–25Google Scholar
  34. 34.
    McMullen PR, Frazier GV (1998) Using simulated annealing to solve a multi-objective assembly line balancing problem with parallel workstations. Int J Prod Res 36(10):2717–2741MATHCrossRefGoogle Scholar
  35. 35.
    Sprecher A (1999) A competitive branch-and-bound algorithm for the simple assembly line balancing problem. Int J Prod Res 37(8):1787–1816MATHCrossRefGoogle Scholar
  36. 36.
    Capacho L, Pastor R, Dolgui A, Guschinskaya O (2009) An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem. Journal of Heuristics 15(2):109–132MATHCrossRefGoogle Scholar
  37. 37.
    Cortes P, Onieva L, Guadix J (2009) Optimizing and simulating the assembly line balancing problem in a motorcycle manufacturing company: a case study. Int J Prod Res 48:3637–3656. doi: 10.1080/00207540902926522 CrossRefGoogle Scholar
  38. 38.
    Miltenburg GJ, Wijngaard J (1994) The U-line line balancing problem. Manag Sci 40(10):1378–1988MATHCrossRefGoogle Scholar
  39. 39.
    Baykasoglu A (2006) Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems. J Intell Manuf 17(2):217–232MathSciNetCrossRefGoogle Scholar
  40. 40.
    Özcan U, Toklu B (2009) A new hybrid improvement heuristic approach to simple straight and U-type assembly line balancing problems. J Intell Manuf 20(1):123–136CrossRefGoogle Scholar
  41. 41.
    Chang CT (2007) Binary fuzzy goal programming. Eur J Oper Res 180(1):29–37MATHCrossRefGoogle Scholar
  42. 42.
    Wu EF, Jin J, Bao JS, Hu XF (2008) A branch-and-bound algorithm for two-sided assembly line balancing. Int J Adv Manuf Technol 39(9–10):1009–1015CrossRefGoogle Scholar
  43. 43.
    Hu X, Wu E, Jin Y (2008) A station-oriented enumerative algorithm for two-sided assembly line balancing. Eur J Oper Res 186(1):435–440MATHCrossRefGoogle Scholar
  44. 44.
    Kim YK, Song WS, Kim JH (2009) A mathematical model and a genetic algorithm for two-sided assembly line balancing. Comput Oper Res 36(3):853–865MATHCrossRefGoogle Scholar
  45. 45.
    Özcan U, Gokcen H, Toklu B (2009) Balancing parallel two-sided assembly lines. Int J Prod Res 48:4767–4784. doi: 10.1080/00207540903074991 CrossRefGoogle Scholar
  46. 46.
    Özcan U, Toklu B (2009) Balancing two-sided assembly lines with sequence-dependent setup times. Int J Prod Res 48:5363–5383. doi: 10.1080/00207540903140750 CrossRefGoogle Scholar
  47. 47.
    Özcan U, Toklu B (2009) Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming models. Comput Oper Res 36(6):1955–1965MATHCrossRefGoogle Scholar
  48. 48.
    Sawik T (2002) Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line. Eur J Oper Res 143(1):115–124MathSciNetMATHCrossRefGoogle Scholar
  49. 49.
    Ozturk C, Tunali S, Hnich B, Ornek AM (2010) Simultaneous balancing and scheduling of flexible mixed model assembly lines with sequence-dependent setup times. Electronic Notes in Discrete Mathematics 36:65–72CrossRefGoogle Scholar
  50. 50.
    Simaria AS, Vilarinho PM (2004) A genetic algorithm based approach to the mixed-model assembly line balancing problem of type II. Comput Ind Eng 47(4):391–407CrossRefGoogle Scholar
  51. 51.
    Venkatesh JVL, Dabade BM (2008) Evaluation of performance measures for representing operational objectives of a mixed model assembly line balancing problem. Int J Prod Res 46(22):6367–6388MATHCrossRefGoogle Scholar
  52. 52.
    Bock S (2008) Using distributed search methods for balancing mixed-model assembly lines in the automotive industry. OR Spectr 30(3):551–578MATHCrossRefGoogle Scholar
  53. 53.
    Ji P, Sze MT, Lee WB (2001) A genetic algorithm of determining cycle time for printed circuit board assembly lines. Eur J Oper Res 128:175–184MATHCrossRefGoogle Scholar
  54. 54.
    Kim YK, Kim Y, Kim YJ (2000) Two-sided assembly line balancing, a genetic algorithm approach. Production Planning and Control 11(1):44–53CrossRefGoogle Scholar
  55. 55.
    Ponnambalam SG, Aravidan P, Naidu GM (2000) A multiobjective genetic algorithm for solving assembly line balancing problems. Int J Adv Manuf Technol 16(5):297–302CrossRefGoogle Scholar
  56. 56.
    Sabuncuoglu I, Erel E, Tanyer M (2000) Assembly line balancing using genetic algorithms. J Intell Manuf 11(3):295–310CrossRefGoogle Scholar
  57. 57.
    Yu J, Yin Y (2010) Assembly line balancing based on an adaptive genetic algorithm. Int J Adv Manuf Technol 48(1–4):347–354CrossRefGoogle Scholar
  58. 58.
    Baykasoğlu A, Özbakır L (2006) Stochastic U-line balancing using genetic algorithms. Int J Adv Manuf Technol 32(1–2):139–147Google Scholar
  59. 59.
    Chen RS, Lu KY, Yu SC (2002) A hybrid genetic algorithm approach on multi-objective of assembly planning problem. Eng Appl Artif Intell 15(5):447–457CrossRefGoogle Scholar
  60. 60.
    Guo ZX, Wong WK, Leung SYS, Fan JT (2009) Intelligent production control decision support system for flexible assembly lines. Expert Systems Appl 36(3):4268–4277CrossRefGoogle Scholar
  61. 61.
    Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2009) A genetic-algorithm-based optimization model for scheduling flexible assembly lines. Int J Adv Manuf Technol 36(1–2):156–168Google Scholar
  62. 62.
    Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2009) A genetic-algorithm-based optimization model for solving the flexible assembly line balancing problem with work sharing and workstation revisiting. IEEE Transactions on Systems, Man and Cybernetics Part C-Applications and Reviews 38(2):218–228CrossRefGoogle Scholar
  63. 63.
    von Laszewski G (1991) Intelligent structural operator for k-way group partitioning problem. In: Belew R, Booker L (eds) Proceedings of the 4th international conference on genetic algorithms. Morgan Kauffman, San Diego, pp 45–52Google Scholar
  64. 64.
    Lee TO, Kim Y, Kim YK (2001) Two-sided assembly line balancing to maximize work relatedness and slackness. Comput Ind Eng 40:273–292CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  • Masoud Rabbani
    • 1
  • Mohsen Moghaddam
    • 1
  • Neda Manavizadeh
    • 1
  1. 1.Department of Industrial Engineering, College of EngineeringUniversity of TehranTehranIran

Personalised recommendations