基于颜色Petri网的再制造工艺过程建模与优化调度方法

In view of the uncertainties inherent in remanufacturing process, a colored Petri net based remanufacturing process model is first proposed to explicitly represent the dynamics of remanufacturing process routings, resource conflicts and process times. A scheduling mathematical model is developed with the objective of minimizing both processing cost and tardiness penalty. A bybrid heuristic using simulated annealing and minimum slack time is also proposed to derive the optimal remanufacturing process routings and operation sequences. The proposed approach is demonstrated through the remanufacturing of used machine tools through matlab programming. The performance of the proposed algorithm is analyzed, as well as the remanufacturing scheduling results.