A New Heuristic Approach to Solving U-shape Assembly Line Balancing Problems Type-1

Assembly line balancing is a very important issue in mass production systems due to production cost. Although many studies have been done on this topic, but because assembly line balancing problems are so complex they are categorized as NP-hard problems and researchers strongly recommend using heuristic methods. This paper presents a new heuristic approach called the critical task method (CTM) for solving U-shape assembly line balancing problems. The performance of the proposed heuristic method is tested by solving a number of test problems and comparing them with 12 other heuristics available in the literature to confirm the superior performance of the proposed heuristic. Furthermore, to prove the efficiency of the proposed CTM, the objectives are increased to minimize the number of workstation (or equivalently maximize line efficiency), and minimizing the smoothness index. Finally, it is proven that the proposed heuristic is more efficient than the others to solve the U-shape assembly line balancing problem. Keywords—Critical task method, Heuristic, Line balancing problem, U-shape

[1]  S. G. Ponnambalam,et al.  A Multi-Objective Genetic Algorithm for Solving Assembly Line Balancing Problem , 2000 .

[2]  S. G. Ponnambalam,et al.  Multi-rule multi-objective Ant Colony Optimization for straight and U-type assembly line balancing problem , 2009, 2009 IEEE International Conference on Automation Science and Engineering.

[3]  Nuchsara Kriengkorakot,et al.  The U-line Assembly Line Balancing Problem , 2012 .

[4]  Soumen Ghosh,et al.  A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems , 1989 .

[5]  George L. Nemhauser,et al.  An Algorithm for the Line Balancing Problem , 1964 .

[6]  Türkay Dereli,et al.  Two-sided assembly line balancing using an ant-colony-based heuristic , 2008 .

[7]  Nuchsara Kriengkorakot,et al.  The Assembly Line Balancing Problem : Review articles * , 2012 .

[8]  Keytack H. Oh Expert line balancing system (ELBS) , 1997 .

[9]  Rainer Kolisch,et al.  Efficient priority rules for the resource-constrained project scheduling problem , 1996 .

[10]  Din-Horng Yeh,et al.  A new bidirectional heuristic for the assembly line balancing problem , 2009, Comput. Ind. Eng..

[11]  Armin Scholl,et al.  State-of-the-art exact and heuristic solution procedures for simple assembly line balancing , 2006, Eur. J. Oper. Res..

[12]  Armin Scholl,et al.  ULINO: Optimally balancing U-shaped JIT assembly lines , 1999 .

[13]  Bilal Toklu,et al.  A new hybrid improvement heuristic approach to simple straight and U-type assembly line balancing problems , 2009, J. Intell. Manuf..

[14]  Adil Baykasoglu,et al.  Multi-rule Multi-objective Simulated Annealing Algorithm for Straight and U Type Assembly Line Balancing Problems , 2006, J. Intell. Manuf..

[15]  Roger L. Wainwright,et al.  Applying genetic algorithms to the U-shaped assembly line balancing problem , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[16]  Fred M. Tonge,et al.  Summary of a Heuristic Line Balancing Procedure , 1960 .

[17]  William V. Gehrlein,et al.  A comparative evaluation of heuristic line balancing techniques , 1986 .

[18]  Joaquín Bautista,et al.  Ant Algorithms for Assembly Line Balancing , 2002, Ant Algorithms.

[19]  Armin Scholl,et al.  Data of assembly line balancing problems , 1995 .