Documents disponibles écrits par cet auteur

New mixed integer linear programming model for solving scheduling problems with special characteristics / Barbara Czuczai in Industrial & engineering chemistry research, Vol. 48 N° 11 (Juin 2009) 

Public ISBD [article]  in Industrial & engineering chemistry research > Vol. 48 N° 11 (Juin 2009) . - pp. 5321–5335 Titre : New mixed integer linear programming model for solving scheduling problems with special characteristics Type de document : texte imprimé Auteurs : Barbara Czuczai, Auteur ; Tivadar Farkas, Auteur ; Endre Rev, Auteur Année de publication : 2009 Article en page(s) : pp. 5321–5335 Note générale : Chemical engineering Langues : Anglais (eng) Mots-clés : Mixed  integer  linear  programming  Scheduling  problems Résumé : A new mixed integer linear programming (MILP) model suitable for optimizing scheduling problems typical in chemical and related industries is developed. These problems have characteristics like storage time constraints, operational connectivity restrictions, and continuous tasks with special precedence constraints. Therefore, a new MILP model is developed for handling these special scheduling problems. The numerical capability of the model is demonstrated using test problems of different complexity levels. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie800124g [article] New mixed integer linear programming model for solving scheduling problems with special characteristics [texte imprimé] / Barbara Czuczai, Auteur ; Tivadar Farkas, Auteur ; Endre Rev, Auteur . - 2009 . - pp. 5321–5335. Chemical engineering Langues : Anglais (eng) in Industrial & engineering chemistry research > Vol. 48 N° 11 (Juin 2009) . - pp. 5321–5335 Mots-clés : Mixed  integer  linear  programming  Scheduling  problems Résumé : A new mixed integer linear programming (MILP) model suitable for optimizing scheduling problems typical in chemical and related industries is developed. These problems have characteristics like storage time constraints, operational connectivity restrictions, and continuous tasks with special precedence constraints. Therefore, a new MILP model is developed for handling these special scheduling problems. The numerical capability of the model is demonstrated using test problems of different complexity levels. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie800124g

Rolling operation algorithm for solving complex scheduling problems / Barbara Czuczai in Industrial & engineering chemistry research, Vol. 48 N° 8 (Avril 2009) 

Public ISBD [article]  in Industrial & engineering chemistry research > Vol. 48 N° 8 (Avril 2009) . - pp. 3898–3908 Titre : Rolling operation algorithm for solving complex scheduling problems Type de document : texte imprimé Auteurs : Barbara Czuczai, Auteur ; Tivadar Farkas, Auteur ; Endre Rev, Auteur Année de publication : 2009 Article en page(s) : pp. 3898–3908 Note générale : Chemical engineering Langues : Anglais (eng) Mots-clés : Large-scale  problems  Rolling  operation”  algorithm Résumé : Large-scale scheduling problems have remained difficult to solve despite the intense research in the area and many successful algorithms. In this paper, a new decomposition algorithm is presented which finds a good feasible solution even for large-scale problems in a reasonable time. In each iteration, a maximum allowed number of operations is first assigned to available units, then the algorithm alternates between a production quantity maximization step and a production time minimization step in each iteration. The performance of the “rolling operation” algorithm is illustrated using an industrial example. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie801037k [article] Rolling operation algorithm for solving complex scheduling problems [texte imprimé] / Barbara Czuczai, Auteur ; Tivadar Farkas, Auteur ; Endre Rev, Auteur . - 2009 . - pp. 3898–3908. Chemical engineering Langues : Anglais (eng) in Industrial & engineering chemistry research > Vol. 48 N° 8 (Avril 2009) . - pp. 3898–3908 Mots-clés : Large-scale  problems  Rolling  operation”  algorithm Résumé : Large-scale scheduling problems have remained difficult to solve despite the intense research in the area and many successful algorithms. In this paper, a new decomposition algorithm is presented which finds a good feasible solution even for large-scale problems in a reasonable time. In each iteration, a maximum allowed number of operations is first assigned to available units, then the algorithm alternates between a production quantity maximization step and a production time minimization step in each iteration. The performance of the “rolling operation” algorithm is illustrated using an industrial example. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie801037k