Deadlock Avoidance of a Kind of JSP with Multi-resources Sharing
Jing Li, Hejiao Huang, Farooq Ahmad · 2008
This paper presents the scheduling problem with multi-resource sharing, which each operation may need more than one kinds of resource.Timed Petri net is used to formulate this problem to analyze deadlock and minimize the makespan.A deadlock avoidance policy addressed here consists of three stages: The first stage is deadlock detection based on transitive matrix and circular waiting.The second one is deadlock recovery by adding new arcs to destroy deadlock.The last stage is deadlock-free design.The efficiency of the method proposed in this paper is illustrated by an example in the end.