Premium
Theoretical and computational comparison of continuous‐time process scheduling models for adjustable robust optimization
Author(s) -
Lappas Nikolaos H.,
Gounaris Chrysanthos E.
Publication year - 2018
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.16124
Subject(s) - computer science , mathematical optimization , robust optimization , scheduling (production processes) , suite , benchmark (surveying) , industrial engineering , mathematics , engineering , archaeology , geodesy , history , geography
Coping with uncertainty in system parameters is a prominent hurdle when scheduling multi‐purpose batch plants. In this context, our previously introduced multi‐stage adjustable robust optimization (ARO) framework has been shown to obtain more profitable solutions, while maintaining the same level of immunity against risk, as compared to traditional robust optimization approaches. This paper investigates the amenability of existing deterministic continuous‐time scheduling models to serve as the basis of this ARO framework. A comprehensive computational study is conducted that compares the numerical tractability of various models across a suite of literature benchmark instances and a wide range of uncertainty sets. This study also provides, for the first time in the open literature, robust optimal solutions to process scheduling instances that involve uncertainty in production yields. © 2018 American Institute of Chemical Engineers AIChE J , 64: 3055–3070, 2018