Open AccessAnalysis of delay time and layout using Heuristics algorithms
Author(s) -
Habtamu Mitiku Feyissa,
A Indra Reddy,
Yakkala. M.K Raghunadh,
B Somanath.
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.i8058.078919
Subject(s) - heuristics , workstation , computer science , heuristic , genetic algorithm , partition (number theory) , algorithm , mathematical optimization , task (project management) , sample (material) , workload , selection (genetic algorithm) , mathematics , machine learning , artificial intelligence , engineering , chemistry , systems engineering , chromatography , combinatorics , operating system
ALB is commonly known as combinatorial optimization problem in manufacturing industries and operation management circumstances. Because of the NP-hard characteristics of ALB problem, lot of tries have been done to solve the problem professionally. The critical concern in analysing ALB is how to generate a possible task order which does not disrupt the priority restrictions. This job arranging is a vigorous work to be answered prior to passing on jobs to workstation. Balance delay time (total idle time) is the total of idle time on fabrication assembly lines triggered by the irregular partition of work among operators or stations. In this thesis, SALBP-1 analysed using the three heuristic techniques. Kilbridge and Westers Method (KWM), Ranked Positional weight (RPW) and biologically inspired evolutionary computing tool which is heuristic treated Genetic Algorithm (GA) was applied to solve the ALB problem with the main aim of reducing the balance delay time in the workstation and the best method was selected. The selection criterion was based on the minimum balance delay for the sample problem. The result obtained by heuristic treated GA with 4.545% of balance delay for the sample problem taken was the best when compared to other two methods.