Int J Performability Eng ›› 2007, Vol. 3 ›› Issue (2): 213-224.doi: 10.23940/ijpe.07.2.p213.mag

• Original articles • Previous Articles     Next Articles

Petri Net and GASA Based Approach for Dynamic JSSP

TAO ZE1, XIE LI-YANG1, HAO CHANG-ZHONG2, and LIU XIAO-XIA1   

  1. 1School of Mechanical Engineering & Automation, Northeastern University, Shenyang 110004, China
    2School of Mechanical Engineering, Shenyang Ligong University, Shenyang 110168, China

Abstract:

A Petri net with controller is used to model discrete events in flexible job shop scheduling problem (JSSP). It not only has the modeling capability of a traditional Petri net, but also it can depict system characteristics, such as equipment maintenance, different types of priorities, and so on. It is flexible in responding to unexpected scenario changes and is thus robust to system disturbances. The JSSP is characterized by flexible routings, and flexible machines and labors; and the scheduling results are obtained based on genetic algorithm and simulated annealing algorithm(GASA). Themethod is developed to address the dynamic scheduling problem in manufacturing systems constrained by machines and labors. After using crossover, mutation, probabilistic updating strategy and re-assignment strategy and so on genetic and simulated operation a best or second best scheduling plan can be found. Simulation results based on job shop scheduling show that the method is feasible and efficient.
Received on January 13, 2006
References: 13