Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are convenient to model systems with bulk services and arrivals. We consider two problems of practical importance for this class of nets. The marking optimization 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. The cycle time optimization problem consists in finding an initial marking to minimize the average cycle time, while the weighted sum of tokens in places is less than or equal to a given value. We propose two heuristic algorithms to solve these problems. Several simulation studies show that the proposed approach is significantly more efficient than existing ones.
|Titolo:||Optimization of deterministic timed weighted marked graphs|
|Data di pubblicazione:||2017|
|Tipologia:||1.1 Articolo in rivista|
File in questo prodotto:
|17tase_draft.pdf||Articolo principale||versione post-print||Open Access Visualizza/Apri|
|He et al_IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING_2017.pdf||articolo||versione editoriale||Administrator Richiedi una copia|