Performance analysis of scheduling rules in remanufacturing operations using stochastic Petri nets

In this paper, we propose an approach for modeling a typical remanufacturing shop and analyzing the scheduling rules using the stochastic Petri nets (SPNs). Previous Works primarily concerned on static scheduling using queuing theory which has difficulty in model extension and complexity analysis, while Petri nets as a well-developed mathematical approach is preferable in considering more complicated stochastic characteristics in scheduling assessment in remanufacturing operations. Based on the proposed SPN framework, we discuss three basic scheduling rules and present three interdependent scheduling algorithms. Furthermore, the numeric results are provided to illustrate the influence of different parameters and scheduling rules on the performance.