By Topic

Heuristic approaches to solve the U-shaped line balancing problem augmented by genetic algorithms

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
$31 $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

2 Author(s)
Martinez, U. ; Dept. of Mech. Eng., Colorado State Univ., Fort Collins, CO ; Duff, W.S.

U-shaped production line can be described as a special type of cellular manufacturing used in just-in-time (JIT) and lean manufacturing. The U-line arranges machines around a U-shaped line in the order in which production operations are performed. Operators work inside the U-line. We address the Type 1 U-LBP using heuristic rules adapted from the simple LBP. Then these heuristic approaches are compared with the optimal solutions obtained from the previous published research work. Finally the heuristic rules are used as genes to find optimal or near optimal solutions using a genetic algorithm adapted from the simple LBP genetic algorithm proposed by Ponnam-balam, Aravindan, and Mogilesswar (2000). The results showed that some very simple heuristic rules produced optimal or near optimal solutions. Then with the simple implementation of a genetic algorithm it is possible to some times obtain optimal solutions in the first iteration

Published in:

Systems and Information Engineering Design Symposium, 2004. Proceedings of the 2004 IEEE

Date of Conference:

16-16 April 2004