Volume 3, Issue 1

Simulated Annealing Algorithm for U- Shaped Line Balancing Problem

Author

K .G .Durga Prasad 1 *, K. Venkata Subbaiah2 ,G. Venu Gopal Rao3 andG.Padmavath4

Abstract

In this paper, Simulated Annealing (SA) algorithm is proposed for solving U-shaped line balancing problem (ULB). In a ULB problem the tasks are assigned to workstations either after all its predecessors or all of its successors, have been assigned to workstations. The objectives considered for the optimisation are to minimise the idle time of a U-shaped line and to minimise the workload deviation among workstations or a combination of both. This paper illustrates SA algorithm for some problems considered from literature and then compared with those of the literature

DOI

https://doi.org/10.62226/ijarst20140189

PAGES : 01-07 | 43 VIEWS | 94 DOWNLOADS

Download Full Article