Abstract: The proposed scheduling algorithm for reconfigurable manufacturing systems is based on timed reconfigurable Petri net. It generates and searches a partial reachable graph to find an optimal or near optimal feasible schedule according to the firing sequence of transitions of the timed reconfigurable Petri net model for a reasonable computational cost. A scheduling example was presented to demonstrate the correctness and feasibility of the algorithm.