Auteur Pedro M. Castro
Documents disponibles écrits par cet auteur (6)
Affiner la recherche
Article : texte imprimé
Pedro M. Castro, Auteur ; Ignacio E. Grossmann, Auteur |We propose linear generalized disjunctive programming (GDP) models for the short-term scheduling problem of single stage batch plants with parallel units. Three different concepts of continuous-time representation are explored, immediate and gen[...]
Article : texte imprimé
Pedro M. Castro, Auteur ; Adrian M. Aguirre, Auteur ; Luis J. Zeballos, Auteur |This article presents a new algorithm for industrially sized problems that, because of the large number of tasks to schedule, are either intractable or result in poor solutions when solved with full-space mathematical programming approaches. Foc[...]
Article : texte imprimé
Pedro M. Castro, Auteur ; Iiro Harjunkoski, Auteur ; Ignacio E. Grossmann, Auteur |This work addresses the scheduling of continuous plants subject to energy constraints related to time-dependent electricity pricing and availability. Discrete- and continuous-time formulations are presented that can address these issues together[...]
Article : texte imprimé
Pedro M. Castro, Auteur |This work addresses the short-term scheduling problem involved in the pipeline transportation of refined petroleum products to distribution centers serving local markets. A new continuous-time formulation is proposed that can handle complex tree[...]
Article : texte imprimé
Pedro M. Castro, Auteur ; Iiro Harjunkoski, Auteur ; Ignacio E. Grossmann, Auteur |This paper presents a new decomposition algorithm for the optimal scheduling of large-scale multiproduct plants containing a large number of orders. Rather than tackling highly complex, full-space problems that cannot be solved in reasonable tim[...]
Article : texte imprimé
Pedro M. Castro, Auteur ; Iiro Harjunkoski, Auteur ; Ignacio E. Grossmann, Auteur |This paper presents a new decomposition algorithm for the optimal scheduling of large-scale multiproduct plants containing a large number of orders. Rather than tackling highly complex, full-space problems that cannot be solved in reasonable tim[...]
