An Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem

In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for each combination. We show the efficiency of the proposed approach for single and mixed-model assembly lines using different benchmarked standard test problems with different number of tasks, stations, skilled workers and demands. Comparisons show the heuristic-simulation algorithm is faster than the GAMS software, and its results are optimum or very close to the optimum values.

[1]  Gürsel A. Süer,et al.  Stochastic skill-based manpower allocation in a cellular manufacturing system , 2014 .

[2]  Alexandre Dolgui,et al.  A taxonomy of line balancing problems and their solutionapproaches , 2013 .

[3]  Alysson M. Costa,et al.  Job rotation in assembly lines employing disabled workers , 2009 .

[4]  Marcus Ritt,et al.  A heuristic and a branch-and-bound algorithm for the Assembly Line Worker Assignment and Balancing Problem , 2014, Comput. Oper. Res..

[5]  Mayron César O. Moreira The assembly line worker integration and balancing problem , 2015, Comput. Oper. Res..

[6]  Jordi Pereira,et al.  A branch-and-bound algorithm for assembly line worker assignment and balancing problems , 2014, Comput. Oper. Res..

[7]  Carlos Andrés,et al.  Advantages of assembly lines in Sheltered Work Centres for Disabled. A case study , 2007 .

[8]  Christian Blum,et al.  On solving the assembly line worker assignment and balancing problem via beam search , 2011, Comput. Oper. Res..

[9]  George Chryssolouris,et al.  Assembly system design and operations for product variety , 2011 .

[10]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[11]  Jordi Pereira,et al.  An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time , 2013, Eur. J. Oper. Res..

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

[13]  Carlos Andrés,et al.  Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled , 2008, Discret. Appl. Math..

[14]  Naveen Kumar,et al.  Assembly Line Balancing: A Review of Developments and Trends in Approach to Industrial Application , 2013 .

[15]  James C. Chen,et al.  Assembly line balancing in garment industry , 2012, Expert Syst. Appl..

[16]  Fariborz Jolai,et al.  A Simulated Annealing algorithm for a mixed model assembly U-line balancing type-I problem considering human efficiency and Just-In-Time approach , 2013, Comput. Ind. Eng..

[17]  X. L. Travassos,et al.  Mixed assembly line rebalancing: A binary integer approach applied to real world problems in the automotive industry , 2012 .

[18]  Nils Boysen,et al.  A classification of assembly line balancing problems , 2007, Eur. J. Oper. Res..