A Hybrid Heuristic Algorithm for Multi-manned Assembly Line Balancing Problem with Location Constraints

Mass customization production is the next stage in the development of production systems that combines an individual approach to the client needs and benefits of mass production. This approach forces manufacturers to seek new, more effective methods of production flow planning, in particular methods for solving the assembly line balancing problem. The traditional approaches and methods proposed for solving balancing problems require adaptation to new constraints associated with the increasingly widespread introduction of multi-manned and spatially divided assembly workstations. This requires considering additional location restrictions and a more complex allocation of tasks in contrast to restricted only by technological precedencies and time constraints for Simple Assembly Line Balancing Problem. The paper presents a proposal for solving the problem of line balancing with location constraints using new hybrid heuristic algorithm, which is a combination of a modified RPW algorithm and a local search of task sequence on assembly stations zones. Moreover, the concepts of smoothness and efficiency is referred to two separate areas: stations and employees. Experimental results for the literature case of a 30 tasks problem indicate the effectiveness of the proposed approach in practice.