Modeling and Analysis of Real-Life Job Shop Scheduling Problems by Petri nets

Real-life job shop scheduling problems are complex due to the needs of considering batches, setup times, transportation and parallel processing all together. This paper presents a method to model this kind of job shop scheduling problems by timed colored Petri nets. Two analysis methods including occurrence graph and simulation analysis for best makespan are proposed. Case studies are given to compare different modeling and analysis methods. Suggestions are proposed to select appropriate method for the scheduling problems in practice.