Reconfiguration planning is recognized as an important factor for reducing the cost of manufacturing reconfigurable products, and the associated main task is to generate a set of optimal or near-optimal reconfiguration sequences using some effect algorithms. A method is developed to generate a Petri net as the reconfiguration tree to represent two-state-transit of product, which solved the representation problem of reconfiguring interfaces replacement. Relating with this method, two heuristic algorithms are proposed to generate task sequences which considering economics to search reconfiguration paths effectively. At last,an objective evaluation is applied to compare these two heuristic algorithms to other ones. The developed reconfiguration task planning heuristic algorithms can generate better strategies and plans for reconfiguration. The research finds are exemplified with struts reconfiguration of reconfigurable parallel kinematics machine (RPKM).