Skip to main content
SpringerLink
Log in

Priority rules-based algorithmic design on two-sided assembly line balancing

  • Assembly
  • Published:
Production Engineering Aims and scope Submit manuscript

Abstract

The two-sided assembly line becomes very popular in recent years. In this paper, a priority rules-based algorithmic design is developed for optimizing two-sided assembly line. Five elementary rules and 90 composite rules are tested on the benchmark data sets and their performance are provided. Two enumerative principles, which are specific to two-sided assembly lines are proposed to enhance the performance of the rules. Further, priority rules are embedded into a bounded dynamic programming framework to form a deterministic algorithm where the use of a bound can reduce the solution space as the algorithm is advanced stage-by-stage. These approaches offer distinct advantages over the methods proposed in the literature, such as less fine-tuning effort and more stable results. Computational results show that the novel algorithm can generate good solutions efficiently, especially in large sized problems.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Adenso-Diaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res 54(1):99–114

    Article  MATH  Google Scholar 

  2. Arcus AL (1965) A computer method of sequencing operations for assembly lines. Int J Prod Res 4(4):259–277

    Article  Google Scholar 

  3. Battaïa O, Dolgui A (2013) A taxonomy of line balancing problems and their solution approaches. Int J Prod Econ 142(2):259–277

    Article  Google Scholar 

  4. Bautista J, Pereira J (2009) A dynamic programming based heuristic for the assembly line balancing problem. Eur J Oper Res 194(3):787–794

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Easton F, Faaland B, Klastorin TD, Schmitt T (1989) Improved network based algorithms for the assembly line balancing problem. Int J Prod Res 27:1901–1915

    Article  Google Scholar 

  9. Fleszar K, Hindi KS (2003) An enumerative heuristic and reduction methods for the assembly line balancing problem. Eur J Oper Res 145(3):606–620

    Article  MathSciNet  MATH  Google Scholar 

  10. Haupt R (1989) A survey of priority rule-based scheduling. OR Spectrum 11:3–16

    Article  MathSciNet  MATH  Google Scholar 

  11. Held M, Karp RM, Shareshian R (1963) Assembly line balancing––dynamic programming with precedence constraints. Oper Res 11:442–459

    Article  MATH  Google Scholar 

  12. Hoffmann TR (1963) Assembly line balancing with a precedence matrix. Manag Sci 9:551–562

    Article  Google Scholar 

  13. Hooker JN (1995) Testing heuristics: we have it all wrong. J Heurist 1(1):33–42

    Article  MATH  Google Scholar 

  14. 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–440

    Article  MATH  Google Scholar 

  15. Hu X, Wu E, Bao J, Jin Y (2010) A branch-and-bound algorithm to minimize the line length of a two-sided assembly line. Eur J Oper Res 206(3):703–707

    Article  MATH  Google Scholar 

  16. Jackson JR (1956) A computing procedure for a line balancing problem. Manag Sci 2(3):261–271

    Article  Google Scholar 

  17. Khorasanian D, Hejazi SR, Moslehi G (2013) Two-sided assembly line balancing considering the relationships between tasks. Comput Ind Eng 66(4):1096–1105

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  19. Lapierre SD, Ruiz AB (2004). Balancing assembly lines: an industrial case study. J Oper Res Soc:589–597

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

    Article  Google Scholar 

  21. Li D, Zhang C, Shao X, Lin W (2016) A multi-objective TLBO algorithm for balancing two-sided assembly line with multiple constraints. J Intell Manuf 27(4):725–739

    Article  Google Scholar 

  22. Make MRA, Rashid MFFA., Razali MM (2017) A review of two-sided assembly line balancing problem. Int J Adv Manuf Technol 2017(89):1743–1763

    Article  Google Scholar 

  23. Otto A, Otto C, Scholl A (2011) How to design and analyze priority rules: example of simple assembly line balancing. Working Papers in Supply Chain Management 3, Friedrich-Schiller-University of Jena

  24. Otto A, Otto C (2014) How to design effective priority rules: example of simple assembly line balancing. Comput Ind Eng 69:43–52

    Article  Google Scholar 

  25. Özbakır L, Tapkan P (2010) Balancing fuzzy multi-objective two-sided assembly lines via Bees Algorithm. J Intell Fuzzy Syst 21(5):317–329

    MATH  Google Scholar 

  26. Scholl A, Voß S (1997) Simple assembly line balancing—heuristic approaches. J Heurist 2(3):217–244

    Article  Google Scholar 

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

  28. Schrage L, Baker KR (1978) Dynamic programming solution of sequencing problems with precedence constraints. Oper Res 26(3):444–449

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  30. Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38(10):1495–1509

    Article  MATH  Google Scholar 

  31. Talbot FB, Patterson JH, Gehrlein WV (1986) A comparative evaluation of heuristic line balancing techniques. Manag Sci 32(4):430–454

    Article  Google Scholar 

  32. Tang Q, Li Z, Zhang LP, Zhang C (2017) Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm. Comput Oper Res 82:102–113

    Article  MathSciNet  Google Scholar 

  33. Tuncel G, Aydin D (2014) Two-sided assembly line balancing using teaching–learning based optimization algorithm. Comput Ind Eng 74:291–299

    Article  Google Scholar 

  34. Vance PH, Barnhart C, Johnson EL, Nemhauser GL (1994) Solving binary cutting stock problems by column generation and branch-and-bound. Comput Optim Appl 3(2):111–130

    Article  MathSciNet  MATH  Google Scholar 

  35. Wang B, Guan Z, Li D, Zhang C, Chen L (2014) Two-sided assembly line balancing with operator number and task constraints: a hybrid imperialist competitive algorithm. Int J Adv Manuf Technol 74(5–8):791–805

    Article  Google Scholar 

  36. Wu EF, Jin Y, 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–1015

    Article  Google Scholar 

  37. Yang XS, Deb S, Loomes M, Karamanoglu M (2013) A framework for self-tuning optimization algorithm. Neural Comput Appl 23(7–8):2051–2057

    Article  Google Scholar 

  38. Yuan B, Zhang C, Shao X (2015) A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints. J Intell Manuf 26(1):159–168

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Economics and Management, Beijing University of Technology, Beijing, China

    Yuchen Li

  2. Industrial and Systems Engineering, Rutgers University, New Brunswick, USA

    David Coit

Authors
  1. Yuchen Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Coit
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuchen Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, Y., Coit, D. Priority rules-based algorithmic design on two-sided assembly line balancing. Prod. Eng. Res. Devel. 12, 95–108 (2018). https://doi.org/10.1007/s11740-017-0786-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11740-017-0786-8

Keywords

Search

Navigation