Deadlock-free scheduling of an automated manufacturing system based on Petri nets

Huanxin Henry Xiong, Mengchu Zhou

Research output: Contribution to journalConference articlepeer-review

31 Scopus citations

Abstract

This paper presents a Petri net based method for deadlock-free scheduling of an automated manufacturing system. The deadlock states are explicitly defined in the Petri net framework. Thus no equation is needed to describe deadlock avoidance constraints to derive deadlock-free schedules as done using mathematical programming techniques. A hybrid heuristic search algorithm which combines heuristic best-first search and controllable backtracking search is employed to generate an optimal or near-optimal deadlock-free schedule. The issues such as deadlock, multiple lot size, limited buffer size and material handling (loading/unloading) are explored through an automated manufacturing system adopted from [Ramaswamy and Joshi 1996].

Original languageEnglish (US)
Pages (from-to)945-950
Number of pages6
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume2
StatePublished - Jan 1 1997
EventProceedings of the 1997 IEEE International Conference on Robotics and Automation, ICRA. Part 3 (of 4) - Albuquerque, NM, USA
Duration: Apr 20 1997Apr 25 1997

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Deadlock-free scheduling of an automated manufacturing system based on Petri nets'. Together they form a unique fingerprint.

Cite this