For modelling and analysis of automated production systems as batch or high throughput systems, timed Petri nets are commonly used. In this paper, we deal with the marking optimization problem of a timed weighted marked graphs under infinite server semantics. The problem consists in finding an initial marking to minimize the weighted sum of tokens in places while the average cycle time is less than or equal to a given value. We propose two different heuristic approaches to solve the optimization problem.

Marking optimization of deterministic timed weighted marked graphs under infinite server semantics

GIUA, ALESSANDRO
2016

Abstract

For modelling and analysis of automated production systems as batch or high throughput systems, timed Petri nets are commonly used. In this paper, we deal with the marking optimization problem of a timed weighted marked graphs under infinite server semantics. The problem consists in finding an initial marking to minimize the weighted sum of tokens in places while the average cycle time is less than or equal to a given value. We propose two different heuristic approaches to solve the optimization problem.
File in questo prodotto:
File Dimensione Formato  
16codit_draft.pdf

Solo gestori archivio

Tipologia: versione post-print
Dimensione 153.89 kB
Formato Adobe PDF
153.89 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11584/178071
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 11
social impact