A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times
By J. Balasubramanian, Ignacio E. Grossmann. 2002
95 citations recorded by the source corpus.
Subfields: Control and Systems Engineering, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/bdb3b2ab7abc649a73dd5c9292095a2651826d14
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Control and Systems Engineering
- Marianthi G. Ierapetritou
- Zukui Li
- Christodoulos A. Floudas
- Xiaoxia Lin
- Ignacio E. Grossmann
- Qi Zhang
- Ruth Misener
- Wolfgang Marquardt
In Industrial and Manufacturing Engineering
Citations in the corpus
- A new robust optimization approach for scheduling under uncertainty: : I. Bounded uncertainty (2004, background): “Balasubramanian and Grossmann (2002) proposed a multiperiod MILP model for scheduling multistage flowshop plants with uncertain processing times. They minimized expected makespan and developed a special branch and bound algorithm with an aggregated probability model. The scenario-based approaches pr”
- Process scheduling under uncertainty: Review and challenges (2008, background): “Balasubramanian and Grossmann (2002) proposed a muliperiod MILP model for scheduling multistage flow-shop plants ith uncertain processing times described by discrete or coninuous (using discretization schemes) probability distributions. alasubramanian and Grossmann (2004) presented a…”
- Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review (2004, methodology): “Balasubramanian and Grossmann (2002) proposed a multiperiod MILP model for scheduling multistage flowshop plants with uncertain processing times described by discrete or continuous (using discretization schemes) probability distributions. The objective is to minimize expected makespan and a special ”