A Genetic Algorithm for Scheduling Flexible Manufacturing Cells

2008 ◽  
Vol 9 (1) ◽  
pp. 97-104 ◽  
Author(s):  
M. T. Taghavi ◽  
M. Heydar ◽  
S. S. Mousavi
2009 ◽  
Vol 407-408 ◽  
pp. 268-272 ◽  
Author(s):  
Li Hong Qiao ◽  
Yi Xin Zhu ◽  
Jian Jun Yang ◽  
Yang Li

The production organized in flexible manufacturing cells (FMC) can be a complicated issue when they are constrained by machines, robots, equipment and some other resources. Since machines and robots are the main bottleneck to the efficiency of FMC, this paper focused on the modeling and scheduling problem constrained by machines and robots. A common model representation, colored timed Petri net (CTPN) was utilized to build a FMC model constrained by robots and machines, which was then transformed to the simulation model. The scheduling problem was studied to establish a mathematical model of the FMC constrained by machines and robots. According to the model, a genetic algorithm was proposed to search an optimal solution by using an indirect coding of scheme. The effectiveness of the proposed algorithm was validated via an instance and the comparison with the result from the solution of simulated annealing algorithm.


1998 ◽  
Vol 6 (11) ◽  
pp. 1411-1420 ◽  
Author(s):  
Per Gullander ◽  
Sven-Arne Andréasson ◽  
Anders Adlemo

Sign in / Sign up

Export Citation Format

Share Document