• 1 Department of Mechanical Engineering, Thiagarajar College of Engineering, Madurai, Tamilnadu 625 015, India
  • 2 Advanced Engineering Platform and School of Engineering, Monash University Malaysia, 46150 Bandar Sunway, Malaysia
  • 3 Department of Manufacturing Engineering, Central Institute of Plastics Engineering & Technology, (Government of India), Chennai, Tamilnadu 600 032, India
ScientificWorldJournal, 2014;2014:458959.
PMID: 24790568 DOI: 10.1155/2014/458959


Products such as cars, trucks, and heavy machinery are assembled by two-sided assembly line. Assembly line balancing has significant impacts on the performance and productivity of flow line manufacturing systems and is an active research area for several decades. This paper addresses the line balancing problem of a two-sided assembly line in which the tasks are to be assigned at L side or R side or any one side (addressed as E). Two objectives, minimum number of workstations and minimum unbalance time among workstations, have been considered for balancing the assembly line. There are two approaches to solve multiobjective optimization problem: first approach combines all the objectives into a single composite function or moves all but one objective to the constraint set; second approach determines the Pareto optimal solution set. This paper proposes two heuristics to evolve optimal Pareto front for the TALBP under consideration: Enumerative Heuristic Algorithm (EHA) to handle problems of small and medium size and Simulated Annealing Algorithm (SAA) for large-sized problems. The proposed approaches are illustrated with example problems and their performances are compared with a set of test problems.

* Title and MeSH Headings from MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine.