Deadlock-free design of JSP with multi-resource sharing

Hejiao Huang; Jing Li; Weisheng Zhou

doi:10.1109/ICCEE.2008.184

Deadlock-free design of JSP with multi-resource sharing

Hejiao Huang^*
, Jing Li
, Weisheng Zhou

^*Corresponding author for this work

Harbin Institute of Technology Shenzhen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008
Pages	412-416
Number of pages	5
DOIs	https://doi.org/10.1109/ICCEE.2008.184
State	Published - 2008
Externally published	Yes
Event	2008 International Conference on Computer and Electrical Engineering, ICCEE 2008 - Phuket, Thailand Duration: 20 Dec 2008 → 22 Dec 2008

Publication series

Name	Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008

Conference

Conference	2008 International Conference on Computer and Electrical Engineering, ICCEE 2008
Country/Territory	Thailand
City	Phuket
Period	20/12/08 → 22/12/08

Access to Document

10.1109/ICCEE.2008.184

Cite this

Huang, H., Li, J., & Zhou, W. (2008). Deadlock-free design of JSP with multi-resource sharing. In Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008 (pp. 412-416). Article 4741018 (Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008). https://doi.org/10.1109/ICCEE.2008.184

@inproceedings{b79a315874fb47d698575cf74faeaf53,

title = "Deadlock-free design of JSP with multi-resource sharing",

abstract = "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.",

author = "Hejiao Huang and Jing Li and Weisheng Zhou",

year = "2008",

doi = "10.1109/ICCEE.2008.184",

language = "英语",

isbn = "9780769535043",

series = "Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008",

pages = "412--416",

booktitle = "Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008",

note = "2008 International Conference on Computer and Electrical Engineering, ICCEE 2008 ; Conference date: 20-12-2008 Through 22-12-2008",

}

Huang, H, Li, J & Zhou, W 2008, Deadlock-free design of JSP with multi-resource sharing. in Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008., 4741018, Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008, pp. 412-416, 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008, Phuket, Thailand, 20/12/08. https://doi.org/10.1109/ICCEE.2008.184

Deadlock-free design of JSP with multi-resource sharing. / Huang, Hejiao; Li, Jing; Zhou, Weisheng.
Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008. 2008. p. 412-416 4741018 (Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Deadlock-free design of JSP with multi-resource sharing

AU - Huang, Hejiao

AU - Li, Jing

AU - Zhou, Weisheng

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/62949140645

U2 - 10.1109/ICCEE.2008.184

DO - 10.1109/ICCEE.2008.184

M3 - 会议稿件

AN - SCOPUS:62949140645

SN - 9780769535043

T3 - Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008

SP - 412

EP - 416

BT - Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008

T2 - 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008

Y2 - 20 December 2008 through 22 December 2008

ER -

Deadlock-free design of JSP with multi-resource sharing

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this