Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur Christos T. Maravelias
Documents disponibles écrits par cet auteur
Affiner la rechercheComputational study of network-based mixed-integer programming approaches for chemical production scheduling / Arul Sundaramoorthy in Industrial & engineering chemistry research, Vol. 50 N° 9 (Mai 2011)
[article]
in Industrial & engineering chemistry research > Vol. 50 N° 9 (Mai 2011) . - pp. 5023-5040
Titre : Computational study of network-based mixed-integer programming approaches for chemical production scheduling Type de document : texte imprimé Auteurs : Arul Sundaramoorthy, Auteur ; Christos T. Maravelias, Auteur Année de publication : 2011 Article en page(s) : pp. 5023-5040 Note générale : Chimie industrielle Langues : Anglais (eng) Mots-clés : Mathematical programming Scheduling Production Mixed integer programming Résumé : The goal of this paper is to discuss the modeling aspects and study the computational performance of scheduling approaches for batch process networks that are based on discrete-time and continuous-time representations. First, we compare the above two modeling approaches in terms of formulation size and modeling capabilities; we brietly review their main characteristics and outline their advantages and disadvantages. Second, we perform an extensive computational comparison between the two methods using a collection of more than 100 problem instances and 800 optimization runs covering five different process networks, various objective functions, different scheduling horizons, and a wide range of features (fixed and variable processing times, utilities, holding and backlog costs, intermediate shipments, and setups). We show that the computational requirements of discrete-time models increase moderately with the incorporation of these additional features, something that cannot be said for continuous-time models. We close with a number of conclusions that we believe will lead to fruitful discussions in the area and foster further development of modeling and solution methods for chemical production scheduling problems. DEWEY : 660 ISSN : 0888-5885 En ligne : http://cat.inist.fr/?aModele=afficheN&cpsidt=24128631 [article] Computational study of network-based mixed-integer programming approaches for chemical production scheduling [texte imprimé] / Arul Sundaramoorthy, Auteur ; Christos T. Maravelias, Auteur . - 2011 . - pp. 5023-5040.
Chimie industrielle
Langues : Anglais (eng)
in Industrial & engineering chemistry research > Vol. 50 N° 9 (Mai 2011) . - pp. 5023-5040
Mots-clés : Mathematical programming Scheduling Production Mixed integer programming Résumé : The goal of this paper is to discuss the modeling aspects and study the computational performance of scheduling approaches for batch process networks that are based on discrete-time and continuous-time representations. First, we compare the above two modeling approaches in terms of formulation size and modeling capabilities; we brietly review their main characteristics and outline their advantages and disadvantages. Second, we perform an extensive computational comparison between the two methods using a collection of more than 100 problem instances and 800 optimization runs covering five different process networks, various objective functions, different scheduling horizons, and a wide range of features (fixed and variable processing times, utilities, holding and backlog costs, intermediate shipments, and setups). We show that the computational requirements of discrete-time models increase moderately with the incorporation of these additional features, something that cannot be said for continuous-time models. We close with a number of conclusions that we believe will lead to fruitful discussions in the area and foster further development of modeling and solution methods for chemical production scheduling problems. DEWEY : 660 ISSN : 0888-5885 En ligne : http://cat.inist.fr/?aModele=afficheN&cpsidt=24128631 Modeling of storage in batching and scheduling of multistage processes / Arul Sundaramoorthy in Industrial & engineering chemistry research, Vol. 47 N°17 (Septembre 2008)
[article]
in Industrial & engineering chemistry research > Vol. 47 N°17 (Septembre 2008) . - p. 6648–6660
Titre : Modeling of storage in batching and scheduling of multistage processes Type de document : texte imprimé Auteurs : Arul Sundaramoorthy, Auteur ; Christos T. Maravelias, Auteur Année de publication : 2008 Article en page(s) : p. 6648–6660 Note générale : Chemical engineering Langues : Anglais (eng) Mots-clés : Multistage processes Storage vessels Batching Scheduling Résumé :
The goal of this paper is the development of a mixed-integer programming formulation for the simultaneous batching and scheduling in multiproduct multistage processes with storage constraints. Storage vessels are modeled as additional processing units for which assignment and sequencing constraints are expressed. Our formulation involves selection (batching), assignment and precedence (scheduling) binary variables as well as batch-size and timing continuous variables. We also discuss a general classification of storage policies in multistage processes and show how the proposed formulation can be readily modified to address all classes of problems. Finally, we extend our approach to address problems with sequence-dependent changeovers and stand-alone scheduling problems, and we present a set of tightening constraints that enhance the solution of the proposed models.En ligne : http://pubs.acs.org/doi/abs/10.1021/ie701737a [article] Modeling of storage in batching and scheduling of multistage processes [texte imprimé] / Arul Sundaramoorthy, Auteur ; Christos T. Maravelias, Auteur . - 2008 . - p. 6648–6660.
Chemical engineering
Langues : Anglais (eng)
in Industrial & engineering chemistry research > Vol. 47 N°17 (Septembre 2008) . - p. 6648–6660
Mots-clés : Multistage processes Storage vessels Batching Scheduling Résumé :
The goal of this paper is the development of a mixed-integer programming formulation for the simultaneous batching and scheduling in multiproduct multistage processes with storage constraints. Storage vessels are modeled as additional processing units for which assignment and sequencing constraints are expressed. Our formulation involves selection (batching), assignment and precedence (scheduling) binary variables as well as batch-size and timing continuous variables. We also discuss a general classification of storage policies in multistage processes and show how the proposed formulation can be readily modified to address all classes of problems. Finally, we extend our approach to address problems with sequence-dependent changeovers and stand-alone scheduling problems, and we present a set of tightening constraints that enhance the solution of the proposed models.En ligne : http://pubs.acs.org/doi/abs/10.1021/ie701737a Scheduling of multistage batch processes under utility constraints / Arul Sundaramoorthy in Industrial & engineering chemistry research, Vol. 48 N° 13 (Juillet 2009)
[article]
in Industrial & engineering chemistry research > Vol. 48 N° 13 (Juillet 2009) . - pp. 6050–6058
Titre : Scheduling of multistage batch processes under utility constraints Type de document : texte imprimé Auteurs : Arul Sundaramoorthy, Auteur ; Christos T. Maravelias, Auteur ; Pradeep Prasad, Auteur Année de publication : 2009 Article en page(s) : pp. 6050–6058 Note générale : Chemical engineering Langues : Anglais (eng) Mots-clés : Mixed-integer programming formulation Multiproduct multistage processes Scheduling Simultaneous batching Storage vessels Résumé : We present a novel discrete-time mixed-integer programming (MIP) formulation for the simultaneous batching and scheduling in multiproduct multistage processes under utility constraints. In addition to processing units and storage vessels, we consider utilities such as cooling water, steam, and electricity that are available in limited quantities. Since different tasks often share the limited utilities at the same time, we use a common time-grid approach. Further, the proposed method handles the batching decisions (the number and sizes of batches) seamlessly without the usage of explicit batch-selection variables. To preserve batch identity in storage vessels, we introduce a new class of inventory variables and constraints. Our approach is the first to address limited utilities for simultaneous batching and scheduling in multistage processes. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie801386m [article] Scheduling of multistage batch processes under utility constraints [texte imprimé] / Arul Sundaramoorthy, Auteur ; Christos T. Maravelias, Auteur ; Pradeep Prasad, Auteur . - 2009 . - pp. 6050–6058.
Chemical engineering
Langues : Anglais (eng)
in Industrial & engineering chemistry research > Vol. 48 N° 13 (Juillet 2009) . - pp. 6050–6058
Mots-clés : Mixed-integer programming formulation Multiproduct multistage processes Scheduling Simultaneous batching Storage vessels Résumé : We present a novel discrete-time mixed-integer programming (MIP) formulation for the simultaneous batching and scheduling in multiproduct multistage processes under utility constraints. In addition to processing units and storage vessels, we consider utilities such as cooling water, steam, and electricity that are available in limited quantities. Since different tasks often share the limited utilities at the same time, we use a common time-grid approach. Further, the proposed method handles the batching decisions (the number and sizes of batches) seamlessly without the usage of explicit batch-selection variables. To preserve batch identity in storage vessels, we introduce a new class of inventory variables and constraints. Our approach is the first to address limited utilities for simultaneous batching and scheduling in multistage processes. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie801386m