Timed Petri net based optimization approach for selective disassembly lot sizing

On the basis of analyzing the basic information of single type of product and constraint relations between parts and components, the constraint relations are showed by Petri net model, in which we introduce the factors of time and resources into places and transitions. This paper proposes lot sizing selective disassembly optimization problem based on timed Petri net with consideration of multi-resources constraints, establishes a mathematical model of this problem aims at minimization of disassembly time, solves the model with CPLEX software, and verifies the effectiveness of this model in solving this type of disassembly optimization problem through the disassembly example of silicon oil fan and several randomly generated problem instances.