메뉴 건너뛰기




Volumn 47, Issue 12, 2008, Pages 4148-4157

Robust optimization for process scheduling under uncertainty

Author keywords

[No Author keywords available]

Indexed keywords

AMERICAN CHEMICAL SOCIETY (ACS); DEGREE OF CONSERVATISM; IN PROCESS; OPTIMIZ ATION PROBLEMS; OPTIMIZATION FORMULATIONS; OPTIMIZATION METHODS; PAPER ADDRESSES; PROCESS SCHEDULING; ROBUST OPTIMIZATION; SCHEDULING PROBLEMS; UNCERTAIN PARAMETERS; WORST-CASE SCENARIO;

EID: 47249135022     PISSN: 08885885     EISSN: None     Source Type: Journal    
DOI: 10.1021/ie071431u     Document Type: Article
Times cited : (100)

References (15)
  • 1
    • 85108976174 scopus 로고
    • Robust optimization of large scale systems
    • Mulvey, J.; Vanderbei, R.; Zenios, S. Robust optimization of large scale systems. Oper. Res. 1995, 43, 264.
    • (1995) Oper. Res , vol.43 , pp. 264
    • Mulvey, J.1    Vanderbei, R.2    Zenios, S.3
  • 2
    • 0033894477 scopus 로고    scopus 로고
    • Robust scheduling of a two-machine flow shop with uncertain processing times
    • Kouvelis, P.; Daniels, R. L.; Vairaktarakis, G. Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Trans. 2000, 32, 421.
    • (2000) IIE Trans , vol.32 , pp. 421
    • Kouvelis, P.1    Daniels, R.L.2    Vairaktarakis, G.3
  • 3
    • 0035904351 scopus 로고    scopus 로고
    • Vin, J. P.; Ierapetritou, M. G. Robust short-term scheduling of multiproduct batch plants under demand uncertainty. Ind. Eng. Chem. Res. 2001, 40, 4543.
    • Vin, J. P.; Ierapetritou, M. G. Robust short-term scheduling of multiproduct batch plants under demand uncertainty. Ind. Eng. Chem. Res. 2001, 40, 4543.
  • 4
    • 0037081993 scopus 로고    scopus 로고
    • A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times
    • Balasubramanian, J.; Grossmann, I. E. A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times. Comput. Chem. Eng. 2002, 26, 41.
    • (2002) Comput. Chem. Eng , vol.26 , pp. 41
    • Balasubramanian, J.1    Grossmann, I.E.2
  • 5
    • 33745739750 scopus 로고    scopus 로고
    • Uncertainty Analysis on the Right-Hand-Side for MILP problems
    • Jia, Z.; Ierapetritou, M. G. Uncertainty Analysis on the Right-Hand-Side for MILP problems. AIChE J. 2006, 52, 2486.
    • (2006) AIChE J , vol.52 , pp. 2486
    • Jia, Z.1    Ierapetritou, M.G.2
  • 6
    • 0010680207 scopus 로고
    • Convex programming with set-inclusive constraints and applications to inexact linear programming
    • Soyster, A. L. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 1973, 21, 1154.
    • (1973) Oper. Res , vol.21 , pp. 1154
    • Soyster, A.L.1
  • 7
    • 0032664938 scopus 로고    scopus 로고
    • Robust solutions to uncertain programs
    • Ben-Tal, A.; Nemirovski, A. Robust solutions to uncertain programs. Oper. Res. Lett. 1999, 25, 1.
    • (1999) Oper. Res. Lett , vol.25 , pp. 1
    • Ben-Tal, A.1    Nemirovski, A.2
  • 8
    • 0032252302 scopus 로고    scopus 로고
    • Robust solutions to uncertain semidefinite programs
    • El-Ghaoui, L.; Oustry, F.; Lebret, H. Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 1998, 9, 33.
    • (1998) SIAM J. Optim , vol.9 , pp. 33
    • El-Ghaoui, L.1    Oustry, F.2    Lebret, H.3
  • 9
    • 84870613023 scopus 로고    scopus 로고
    • Robust Discrete optimization and Network Flows
    • Bertsimas, D.; Sim, M. Robust Discrete optimization and Network Flows. Math. Prog. 2003, 98, 49.
    • (2003) Math. Prog , vol.98 , pp. 49
    • Bertsimas, D.1    Sim, M.2
  • 10
    • 1942532282 scopus 로고    scopus 로고
    • Lin, X.; Janak, S. L.; Floudas, C. A. A new robust optimization approach for scheduling under uncertainty: I. bounded uncertainty. Comput. Chem. Eng. 2004, 28, 1069.
    • Lin, X.; Janak, S. L.; Floudas, C. A. A new robust optimization approach for scheduling under uncertainty: I. bounded uncertainty. Comput. Chem. Eng. 2004, 28, 1069.
  • 11
    • 0442266090 scopus 로고    scopus 로고
    • Robust solutions of Linear Programming problems contaminated with uncertain data
    • Ben-Tal, A.; Nemirovski, A. Robust solutions of Linear Programming problems contaminated with uncertain data. Math. Prog. 2000, 88, 411.
    • (2000) Math. Prog , vol.88 , pp. 411
    • Ben-Tal, A.1    Nemirovski, A.2
  • 12
    • 0032216021 scopus 로고    scopus 로고
    • Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes
    • Ierapetritou, M. G.; Floudas, C. A. Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes. Ind. Eng. Chem. Res. 1998, 37, 4341.
    • (1998) Ind. Eng. Chem. Res , vol.37 , pp. 4341
    • Ierapetritou, M.G.1    Floudas, C.A.2
  • 13
    • 2442583184 scopus 로고    scopus 로고
    • Continuous-time versus discrete-time approaches for scheduling of chemical processes: A review
    • Floudas, C. A.; Lin, X. Continuous-time versus discrete-time approaches for scheduling of chemical processes: A review. Comput. Chem. Eng. 2004, 28, 2109.
    • (2004) Comput. Chem. Eng , vol.28 , pp. 2109
    • Floudas, C.A.1    Lin, X.2
  • 14
    • 33748102266 scopus 로고    scopus 로고
    • State-of-the-art review of optimization methods for short-term scheduling of batch processes
    • Méndez, C. A.; Cerdá, J.; Grossmann, I. E.; Harjunkoski, I.; Fahl, M. State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput. Chem. Eng. 2006, 30, 913.
    • (2006) Comput. Chem. Eng , vol.30 , pp. 913
    • Méndez, C.A.1    Cerdá, J.2    Grossmann, I.E.3    Harjunkoski, I.4    Fahl, M.5
  • 15
    • 0041805288 scopus 로고    scopus 로고
    • Decomposition approaches for the efficient solution of short-term scheduling problems
    • Wu, D.; Ierapetritou, M. G. Decomposition approaches for the efficient solution of short-term scheduling problems. Comput. Chem. Eng. 2003, 27, 1261.
    • (2003) Comput. Chem. Eng , vol.27 , pp. 1261
    • Wu, D.1    Ierapetritou, M.G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.