By Topic

A search method using Genetic Algorithm for production reactive scheduling of manufacturing systems

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)
Orides Morandin ; Federal University of São Carlos (UFSCar) Department of Computer Science São Carlos, SP, Brazil ; Edilson R. R. Kato ; Ana C. Deriz ; Danilo S. Sanches

The problem for scheduling the manufacturing systems production involves the modeling task and the application of a technique to solve it. There are some ways used to model such problem and some search strategies have been applied on the model to find a solution. The solution has to consider performances parameters like makespan or another. However, depending on the size and complexity of the system, the response time becomes critical, mostly when itpsilas necessary a reschedule. Researches aim to use genetic algorithms as a search method to solve the scheduling problem. This work proposes the use of genetic algorithm to solve this problem having as performance criteria the minimum makespan and the response time.

Published in:

2008 IEEE International Symposium on Industrial Electronics

Date of Conference:

June 30 2008-July 2 2008