Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Deadlock-free scheduling method for automated manufacturing systems using genetic algorithm and Petri nets

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Zhonghua Huang ; Dept. of Autom., Shanghai Jiao Tong Univ., China ; Zhiming Wu

A class of flexible manufacturing systems is modeled by timed Petri nets, and a new deadlock free scheduling method based on genetic algorithm and timed Petri net model is proposed. Under the framework of timed Petri nets model, the scheduling problem can be formulated as finding a feasible transition firing sequence to avoid the deadlock situation and to minimize the makespan. In the genetic algorithm, Petri net transition sequence is coded and a deadlock detection method based on siphon technology is addressed to reschedule the sequence of transitions, and thus the quality of solutions can be improved. In the fitness computation procedure, a penalty item for the infeasible solution is involved to prevent the search process from converging to the infeasible solutions. The method proposed In this work can get a feasible scheduling strategy as well as enable the system to achieve good performance, and this is shown by simulation results.

Published in:

Robotics and Automation, 2004. Proceedings. ICRA '04. 2004 IEEE International Conference on  (Volume:1 )

Date of Conference:

26 April-1 May 2004