A Petri Net and Genetic Algorithm Based Method for Flexible Manufacturing Cells Modeling and Scheduling

Abstract:

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.

• Periodical: Key Engineering Materials (Volumes 407-408)
• Pages: 268-272
• DOI: https://doi.org/10.4028/www.scientific.net/KEM.407-408.268
• Online since: February 2009
• Authors: Li Hong Qiao, Yi Xin Zhu, Jian Jun Yang, Yang Li
• Keywords: Colored Timed Petri Nets, Flexible Manufacturing Cell, Genetic Algorithm (GA), Job Shop Scheduling, Resource Constraint

References

[1] T. Hsu, O. Korbaa, R. Dupas, G. Goncalves: European Journal of Operational Research, Vol. 191(2008), pp.464-484.

DOI: 10.1016/j.ejor.2007.02.055

[2] J. T. Lin, C. Lee: Computer Integrated Manufacturing Systems, Vol. 10(1997), No. 2, pp.119-122.

[3] D. Liang, L. Xie, T. Sui, Z. Tao: Journal of Northeastern University(Natural Science), Vol. 27(2006), No. 8, pp.895-898.

[4] R. Cheng, M. Gen, Y. Tsujimura: International Journal of Computers and Industrial Engineering, Vol. 30(1996), No. 4, pp.983-997.

[5] U. Dorndof, E. Pesch: Computers and Operations Research, Vol. 22(1995), pp.25-40.