Abstract

An aim of sustainable development of the manufacturing industry is to reduce the idle time in the product-assembly process and improve the balance efficiency of the assembly line. A priority relationship diagram is obtained on an existing assembly line in the laboratory by measuring the task time of the chassis model, analyzing the product structure, and designing the assembly process. The type-E balance model of the U-shaped assembly line is established and solved by a heuristic algorithm based on the comprehensive rank value. The type-E balance problem of the U-shaped assembly-line plan of the chassis model is obtained, and the production line layout is planned. Combining instances to compare the results of the heuristic algorithm, genetic algorithm, and simulated annealing, comparison of the results shows that the degree of load balancing is slightly higher than genetic algorithm and simulated annealing. The balance efficiencies obtained by the heuristic algorithm are smaller than the genetic algorithm and simulated annealing. The calculation time is significantly less than the genetic algorithm and simulated annealing, and the scale of instances has little effect on the calculation time. The results verify that the model and the algorithm are effective. This study provides a reference for the entire process of the U-shaped assembly-line, type-E balance and the assembly products in laboratories.

Highlights

  • Aiming to upgrade facilities and improve equipment, manufacturing companies are pursuing production efficiencies and cost reductions by transforming the traditional straight assembly lines into the U-shaped assembly lines (UAL)

  • We propose a heuristic algorithm based on the comprehensive rank value, combined with the chassis model assembly experiment example, quickly solve the U-shaped assembly-line, type-E balance model, and design the layout of the UAL

  • A heuristic algorithm (HA) with a comprehensive rank value is to assign tasks to workstations of the U-shaped assembly line according to a comprehensive rank value of the tasks and realize the balance of work time to achieve the balance of the assemblyline system

Read more

Summary

Introduction

Aiming to upgrade facilities and improve equipment, manufacturing companies are pursuing production efficiencies and cost reductions by transforming the traditional straight assembly lines into the U-shaped assembly lines (UAL). Proposed the U-shaped assembly line balance problem (UALBP) with the shortest path method and applied a heuristic algorithm to solve the UALBP. Mukund [17] proposed a particle swarm algorithm to solve the U-shaped robot assembly-line-balance problem, adding robots to the assembly line to achieve sustainable development. Proposed a heuristic algorithm to solve the fuzzy, assembly-line, type-E balance problem. We propose a heuristic algorithm based on the comprehensive rank value, combined with the chassis model assembly experiment example, quickly solve the U-shaped assembly-line, type-E balance model, and design the layout of the UAL. Thirty instances are carried out, we use a heuristic algorithm based on the comprehensive rank value, genetic algorithm, and simulated annealing to solve the U-shaped assembly line type-E balance problem (UALEBP), and compare the results of three algorithms

U-Shaped Assembly Line
U-Shaped
Mathematical
Notations
Mathematical Model
Heuristic Algorithm
Assignment Relations
Comprehensive Rank Value
A Heuristic Algorithm Based on Comprehensive Rank Value
Experimental Case
Experimental Set-Up
Priority Relationship Diagram
Comprehensive Rank relationship
Comprehensive Rank Value of Chassis Model
Results and Evaluation
Classic
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.