By Topic

A genetic algorithm to solving the problem of flexible manufacturing system cyclic scheduling

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

3 Author(s)

We are interested in the determination of the command of Flexible Manufacturing Systems (FMS). We have chosen the Cyclic Behavior to reduce the complexity of the general,scheduling problem. The aim is to propose a new one based on genetic algorithms which can reach the optimal production speed while minimizing the Work in Process (W.I.P.). In fact we want to minimize the W.L.P. to satisfy economical constraints. The use of genetic algorithms is justified by the huge combinatorial complexity of such problems (NP hard in the general case). Indeed, this kind of algorithm is able to give a solution at any moment. Our approach was validated on a set of five FMS cyclic scheduling test problems.

Published in:

Systems, Man and Cybernetics, 2002 IEEE International Conference on  (Volume:3 )

Date of Conference:

6-9 Oct. 2002