In this paper we provide a brief knowledge and informal introduction to the theory of Petri nets and the modeling lechniques that we can use in the scheduling formulations. We consider the marked graphs and magot’s method for computing cycle times. This formulation can be extended to a subclass of decision – permitted Petri nets, in which we call them as choosing – gates. Flow problem that this subclass is a mixed –integer programming and has similarities with fired-charge AMS subject classification :05
