Redes de Petri y algoritmos genéticos: una propuesta para la programación de sistemas de manufactura flexible

This paper uses the Petri networks and genetic algorithms strengths for modelling and solving manufacturing systems and combinatorial problems, respectively. This article generates active schedules for flexible manufacturing systems that minimize weighted tardiness. The algorithm works for problems involving aspects such as: setups dependent on the operations sequences, stations with non identical parallel machines and stations buffers with finite capacity. Some of the obtained computational results make as believe it could be considered as a promise field for future works.