Documents disponibles écrits par cet auteur

Combinatorial algorithms of the S-graph framework for batch scheduling / Maté Hegyhati in Industrial & engineering chemistry research, Vol. 50 N° 9 (Mai 2011) 

Public ISBD [article]  in Industrial & engineering chemistry research > Vol. 50 N° 9 (Mai 2011) . - pp. 5169-5174 Titre : Combinatorial algorithms of the S-graph framework for batch scheduling Type de document : texte imprimé Auteurs : Maté Hegyhati, Auteur ; Ferenc Friedler, Auteur Année de publication : 2011 Article en page(s) : pp. 5169-5174 Note générale : Chimie industrielle Langues : Anglais (eng) Mots-clés : Scheduling  Batchwise  Algorithm Résumé : Methods for solving batch process scheduling problems have gone through a vast development in the last 2 decades. Most of the published approaches are based on a mixed integer programming formulation. Since the difficulty of scheduling is originated from its combinatorial nature, graphs and combinatorial algorithms are more adequate to represent and solve the problem. Although, combinatorial algorithms and data structures have an enormous literature, these algorithms can not be directly applied to scheduling and further elaboration is needed. In the present work, the combinatorial nature of batch scheduling problems is analyzed. Several combinatorial algorithms are listed that can be considered for the scheduling of batch processes. Their proper adaptation is illustrated via the S-graph framework, in which the main emphasis lies on the combinatorial tools. Furthermore, Place Petri Nets and Timed Automata are also briefly described. An S-graph algorithm has been extensively compared with well-known MILP formulations. DEWEY : 660 ISSN : 0888-5885 En ligne : http://cat.inist.fr/?aModele=afficheN&cpsidt=24128640 [article] Combinatorial algorithms of the S-graph framework for batch scheduling [texte imprimé] / Maté Hegyhati, Auteur ; Ferenc Friedler, Auteur . - 2011 . - pp. 5169-5174. Chimie industrielle Langues : Anglais (eng) in Industrial & engineering chemistry research > Vol. 50 N° 9 (Mai 2011) . - pp. 5169-5174 Mots-clés : Scheduling  Batchwise  Algorithm Résumé : Methods for solving batch process scheduling problems have gone through a vast development in the last 2 decades. Most of the published approaches are based on a mixed integer programming formulation. Since the difficulty of scheduling is originated from its combinatorial nature, graphs and combinatorial algorithms are more adequate to represent and solve the problem. Although, combinatorial algorithms and data structures have an enormous literature, these algorithms can not be directly applied to scheduling and further elaboration is needed. In the present work, the combinatorial nature of batch scheduling problems is analyzed. Several combinatorial algorithms are listed that can be considered for the scheduling of batch processes. Their proper adaptation is illustrated via the S-graph framework, in which the main emphasis lies on the combinatorial tools. Furthermore, Place Petri Nets and Timed Automata are also briefly described. An S-graph algorithm has been extensively compared with well-known MILP formulations. DEWEY : 660 ISSN : 0888-5885 En ligne : http://cat.inist.fr/?aModele=afficheN&cpsidt=24128640