Deadlock Avoidance of a Kind of JSP with Multi-resources Sharing

DOI

10.2991/jcis.2008.95How to use a DOI?

Keywords

Petri net, JSP, Deadlock Avoidance, Transitive matrix

Abstract

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.

Copyright

© 2008, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jing Li
AU  - Hejiao Huang
AU  - Farooq Ahmad
PY  - 2008/12
DA  - 2008/12
TI  - Deadlock Avoidance of a Kind of JSP with Multi-resources Sharing
BT  - Proceedings of the 11th Joint Conference on Information Sciences (JCIS 2008)
PB  - Atlantis Press
SP  - 565
EP  - 570
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2008.95
DO  - 10.2991/jcis.2008.95
ID  - Li2008/12
ER  -