Journal of Electrical Engineering : Volume 18 / 2018 - Edition : 4

META HEURISTIC BASED SIMULATED ANEALING APPROACH FOR DESIGN OF U-SHAPED MANUFACTURING ASSEMBLY LINE BALANCING

Authors:
V.Thangadurai
V.Thangadurai
Domain:
building electrification
Abstract:
The objective of this study is to resolve the balancing problem comprising a shared U-shaped assembly line which is exclusively designed by a Simulated Annealing Algorithm. The proposed algorithm may be utilized in medium and large scale problems. This approach envisages an efficient mechanism which associates a large solution space search for revealing an optimal solution. The existing balancing problem is just a conventional straight assembly line, limits its application to production line where every tasks are grouped into workstations. Line balancing is a process that balances the tasks among various workstations that is based upon precedence relation. The concept of shared principle enhances its efficiency by reducing the number of workstations. When compared with the conventional assembly line, the U-shaped assembly line clearly stresses on the balancing problem by allocating the tasks in forward, backward, or in both directions with respect to the precedence relation. The efficiency revealed by SAA for the shared U-shaped assembly line has proved better when compared to existing lines. The Simulated Annealing Algorithm (SAA) heuristic approach is projected to solve the medium and large sized problems by suggesting two objectives concurrently (i) To reveal the optimal number of work stations and (ii) to find the unbalance time among workstations for a fixed cycle time. The proposed approach is elaborated with a model problem and its performance is scrutinized with a se
Download Article:
 
This article is written in Adobe PDF format ( .pdf file ).To view this article you need to download the file. Please rightclick on the link below and then select "Save target as" to download the file to your harddrive. Download Article
Jee homepage | Jee Archive | Hard Copy | Publishers | Contact