By Topic

A grouping genetic algorithm for the assembly line balancing problem of sewing lines in garment industry

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
James C. Chen ; Department of Industrial and Systems Engineering, Chung Yuan Christian University, Chung Li, Taiwan 320, R.O.C ; Mabel H. Hsaio ; Chun-Chieh Chen ; Cheng-Ju Sun

The garment manufacturing is a traditional and fashion industry, that is globally competitive and customer centric. The most critical operation process is sewing, as it generally involves a great number of operations. The aim of assembly line balancing planning in sewing lines is to assign task to the workstation in order that the machines of the workstation can perform the assigned tasks with a balanced loading. Assembly line balancing problem (ALBP) is known as an NP-hard problem. Thus, the heuristic methodology could be a better way to plan the sewing lines in a reasonable time. This paper presents a grouping genetic algorithm (GGA) for assembly line balancing problem of sewing lines in garment industry. GGA was first developed by Falkenauer in 1992 as a type of GA which exploits the special structure of grouping problem, and overcomes the drawbacks of GA. GGA allocates workload among machines as evenly as possible, so the minimum mean absolute deviations (MAD) can be minimized. The performance is verified through solving two real problems in garment industry. The computational results reveal that GGA outperforms GA in both simple and complex problems by 13.81% and 8.81%, respectively. This shows GGA's effectiveness in solving ALBP.

Published in:

2009 International Conference on Machine Learning and Cybernetics  (Volume:5 )

Date of Conference:

12-15 July 2009