By Topic

A Genetic-Algorithm-Based Optimization Model for Solving the Flexible Assembly Line Balancing Problem With Work Sharing and Workstation Revisiting

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

5 Author(s)
Z. X. Guo ; Hong Kong Polytech. Univ., Kowloon ; W. K. Wong ; S. Y. S. Leung ; J. T. Fan
more authors

This paper investigates a flexible assembly line balancing (FALB) problem with work sharing and workstation revisiting. The mathematical model of the problem is presented, and its objective is to meet the desired cycle time of each order and minimize the total idle time of the assembly line. An optimization model is developed to tackle the addressed problem, which involves two parts. A bilevel genetic algorithm with multiparent crossover is proposed to determine the operation assignment to workstations and the task proportion of each shared operation being processed on different workstations. A heuristic operation routing rule is then presented to route the shared operation of each product to an appropriate workstation when it should be processed. Experiments based on industrial data are conducted to validate the proposed optimization model. The experimental results demonstrate the effectiveness of the proposed model to solve the FALB problem.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)  (Volume:38 ,  Issue: 2 )