Using S-graph to address uncertainty in batch plants

Clean Technologies and Environmental Policy

Volumn 12, Issue 2, 2010, Pages 105-115

  Laínez, José Miguel ^a   Hegyháti, Máté ^b   Friedler, Ferenc ^b   Puigjaner, Luis ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF PANNONIA   (Hungary)

Author keywords

S graph; Scheduling; Uncertainty

Indexed keywords

GRAPH THEORY; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS;

COMPLEX ENVIRONMENTS; COMPUTATIONAL EXPENSE; DETERMINISTIC SCHEDULING; GRAPH THEORETIC APPROACH; PERFORMANCE EVALUATOR; S-GRAPH; STOCHASTIC SCHEDULING; UNCERTAINTY;

SCHEDULING;

EID: 77953358642     PISSN: 1618954X     EISSN: 16189558     Source Type: Journal    
DOI: 10.1007/s10098-009-0240-5     Document Type: Article

References (16)

1. Castro P, Barbosa-Pavoa A, Matos H (2001) An improved RTN continuous-time formulation for the short-term scheduling of multipurpose batch plants. Ind Eng Chem Res 40:2059-2068.
2. Cerda J, Henning GP, Grossmann IE (1997) A mixed-integer linear programming model for short-term scheduling of single-stage multiproduct batch plants with parallel lines. Ind Eng Chem Res 36:1695-1707.
3. Cheng L, Subrahmanian E, Westerberg AW (2004) A comparison of optimal control and stochastic programming from a formulation and computation perspective. Comput Chem Eng 29:149-164.
4. Friedler F, Majozi T, Holczinger T (2008) Implications of crosstransfer in batch plants with complex recipes: S-graph vs MILP methods. In: Proceedings of 11th conference on process integration, modelling and optimisation for energy saving and pollution reduction-PRES 2008 P5.129, Prague: Orgit Ltd publicatios, ISBN: 978-80-02-02047-9 (CD-ROM).
5. Kondili E, Pantelides CC, Sargent R (1993) A general algorithm for short-term scheduling of batch operations. Part 1. MILP formulation. Comput Chem Eng 17:211-227. (Pubitemid 23633373)
6. Li Z, Ierapetritou M (2008) Process scheduling under uncertainty: review and challenges. Comput Chem Eng 32:715-727.
7. Lin X, Floudas CA (2004) Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review. Comput Chem Eng 28:2109-2129.
8. Lin X, Floudas CA, Modi S, Juhasz NM (2002) Continuous-time optimization approach for medium-range production scheduling of a multiproduct batch plant. Ind Eng Chem Res 41:3884-3906.
9. Majozi T, Friedler F (2006) Maximization of throughput in a multipurpose batch plant under a fixed time horizon: S-graph approach. Ind Eng Chem Res 45:6713-6720. (Pubitemid 44562339)
10. Majozi T, Zhu X (2001) A novel continuous-time milp formulation for multipurpose batch plants. Part 1. Short-term scheduling. Ind Eng Chem Res 40:5935-5949. (Pubitemid 33131026)
11. Méndez CA, Cerda J (2002) An MILP framework for short-term scheduling of single-stage batch plants with limited discrete resources. In: Computer-aided chemical engineering, vol 12. Elsevier Science Ltd, Amsterdam, pp 721-726.
12. Pantelides C (1994) Unified frameworks for optimal process planning and scheduling. In: Rippin DWT, Hale JC, Davis J (eds) Proceedings of the second international conference on foundations of computer-aided process operations. Cache publications, New York, pp 253-274.
13. Pekny JF, Reklaitis GV (1998) Towards the convergence of theory and practice: A technology guide for scheduling/planning methodology. In: Pekny Blau (ed) Proceedings of the third international conference on foundations of computer-aided process operations. Cache publications, New York, pp 91-111.
14. Pinto JM, Grossmann IE (1995) A continuous time mixed integer linear programming model for short-term scheduling of multistage batch plants. Ind Eng Chem Res 34:3037-3051.
15. Romero J, Puigjaner L, Holczinger T, Friedler F (2004) Scheduling intermediate storage multipurpose batch plants using the S-graph. AIChE J 50:403-417.
16. Sanmartí E, Puigjaner L, Holczinger T, Friedler F (2002) Combinatorial framework for effective scheduling of multipurpose batch plants. AIChE J 48:2557-2570.