Deadlock-Free Design of JSP with Multi-Resource Sharing

Deadlock avoidance is important and hard for system designer of job-shop scheduling problem (JSP), especially in multi-resource sharing system. This paper addressed a deadlock-free design method of JSP with multi-resource sharing, which some operation may need more than one kind of resource. Timed Petri net (TPN) is used to formulate this problem and to analyze deadlock in order to get the makespan. Based on TPN, dead marking and dead transitions are detected by transformation of marking, and a condition of deadlock is given. Furthermore, deadlock recovery method is presented by adding some control places on dead transitions, and a deadlock-free design algorithm is proposed. The efficiency of the method proposed is illustrated by an example in the end.