Efficient search of Petri Nets for deadlock-free scheduling in FMSs using heuristic functions

Author： ELMEKKAWY TAREK Y.   ELMARAGHY HODA A.  

Publisher： Taylor & Francis Ltd

ISSN： 1362-3052

Source： International Journal of Computer Integrated Manufacturing, Vol.16, Iss.1, 2003-01, pp. : 14-24

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Applications of resource assignment and scheduling with Petri Nets and heuristic search

By Mejía Gonzalo  

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 795-812

Springer Publishing Company

Access to resources Recommend Favorite

Deadlock-free verification and performance enhancement of RosettaNet PIPs with time Petri nets

By Liao Da-Yin   Liu Paladin  

International Journal of Computer Integrated Manufacturing, Vol. 18, Iss. 2-3, 2005-03 ,pp. : 199-209

Taylor & Francis Ltd

Access to resources Recommend Favorite

Modelling the machine loading problem of FMSs and its solution using a tabu-search-based heuristic

By Sarma U. M. B. S.   Kant Suman   Rai Rahul   Tiwari M. K.  

International Journal of Computer Integrated Manufacturing, Vol. 15, Iss. 4, 2002-07 ,pp. : 285-295

Taylor & Francis Ltd

Access to resources Recommend Favorite

Deadlock-free motion planning using the Laplace potential field

By Sato Keisuke  

Advanced Robotics, Vol. 7, Iss. 5, 1992-01 ,pp. : 449-461

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Generalized Deadlock-Free Process Calculus

By Sumii E.   Kobayashi N.  

Electronic Notes in Theoretical Computer Science, Vol. 16, Iss. 3, 2004-01 ,pp. : 1-23

Elsevier

Access to resources Recommend Favorite