Decomposition of timed Petri Nets for solving scheduling problems with multiple entities

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we propose a general decomposition and coordination method for timed Petri Nets to determine an optimal transition firing sequence to minimize an objective function. A timed Petri Net model for multiple entities is decomposed into several subnets in which the optimal firing sequence for each subnet is easily solved in polynomial computational complexity. The solution of each subproblem is coordinated by repetitive optimization of the number of tokens for duplicated places. The proposed method is applied to a flowshop scheduling problem. The effectiveness of the proposed method is confirmed by comparing the performance between the simulated annealing method.

Original languageEnglish
Title of host publicationProceedings - Eighth International Symposium on Autonomous Decentralized Systems, ISADS 2007
Pages478-483
Number of pages6
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event8th International Symposium on Autonomous Decentralized Systems, ISADS 2007 - Sedona, AZ, United States
Duration: Mar 21 2007Mar 23 2007

Publication series

NameProceedings - Eighth International Symposium on Autonomous Decentralized Systems, ISADS 2007

Conference

Conference8th International Symposium on Autonomous Decentralized Systems, ISADS 2007
CountryUnited States
CitySedona, AZ
Period3/21/073/23/07

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'Decomposition of timed Petri Nets for solving scheduling problems with multiple entities'. Together they form a unique fingerprint.

Cite this