@book{
 title = {Batch process scheduling under uncertainty using data-driven multistage adaptive robust optimization},
 type = {book},
 year = {2017},
 source = {Chemical Engineering Transactions},
 identifiers = {[object Object]},
 volume = {61},
 id = {fce4729a-5d52-352a-9202-ce4a517b3ee1},
 created = {2017-12-15T21:38:14.513Z},
 file_attached = {false},
 profile_id = {f27171f8-b200-3870-9028-dcb6a084733d},
 last_modified = {2017-12-15T21:38:14.513Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 private_publication = {true},
 abstract = {Copyright © 2017, AIDIC Servizi S.r.l. This paper proposes a novel data-driven batch process scheduling approach based on multistage adaptive robust optimization coupled with robust kernel density estimation (RKDE). The kernelized iteratively re-weighted lease squares (KIRWLS) algorithm combined with kernel tricks are adopted to learn the probability density function from outlier-corrupted uncertain processing time data. We then propose a data-driven outlier-resilient uncertainty set for scheduling problem using the extracted distributional information. The proposed framework exhibits robustness to contamination of uncertainty data by integrating robust optimization with robust statistics. The batch process scheduling is then formulated as a data-driven multistage decision-making problem. By introducing affine decision rules for recourse variables, the resulting data-driven multistage adaptive robust optimization problem can be solved efficiently. We apply the proposed data-driven multistage adaptive robust optimization to a multipurpose batch process scheduling problem using a dataset to demonstrate the superiority of the proposed method. Our proposed approach generates $13,851 more profits than those of multistage adaptive robust optimization with box set. Compared with the multistage adaptive robust optimization using kernel density estimation (KDE), the result returned from the proposed method generates $4,064 more profits.},
 bibtype = {book},
 author = {Ning, C. and You, F.}
}

{"_id":"kZ45f7xtCsGgw8ccL","bibbaseid":"ning-you-batchprocessschedulingunderuncertaintyusingdatadrivenmultistageadaptiverobustoptimization-2017","downloads":0,"creationDate":"2017-12-28T02:43:51.833Z","title":"Batch process scheduling under uncertainty using data-driven multistage adaptive robust optimization","author_short":["Ning, C.","You, F."],"year":2017,"bibtype":"book","biburl":null,"bibdata":{"title":"Batch process scheduling under uncertainty using data-driven multistage adaptive robust optimization","type":"book","year":"2017","source":"Chemical Engineering Transactions","identifiers":"[object Object]","volume":"61","id":"fce4729a-5d52-352a-9202-ce4a517b3ee1","created":"2017-12-15T21:38:14.513Z","file_attached":false,"profile_id":"f27171f8-b200-3870-9028-dcb6a084733d","last_modified":"2017-12-15T21:38:14.513Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"private_publication":"true","abstract":"Copyright © 2017, AIDIC Servizi S.r.l. This paper proposes a novel data-driven batch process scheduling approach based on multistage adaptive robust optimization coupled with robust kernel density estimation (RKDE). The kernelized iteratively re-weighted lease squares (KIRWLS) algorithm combined with kernel tricks are adopted to learn the probability density function from outlier-corrupted uncertain processing time data. We then propose a data-driven outlier-resilient uncertainty set for scheduling problem using the extracted distributional information. The proposed framework exhibits robustness to contamination of uncertainty data by integrating robust optimization with robust statistics. The batch process scheduling is then formulated as a data-driven multistage decision-making problem. By introducing affine decision rules for recourse variables, the resulting data-driven multistage adaptive robust optimization problem can be solved efficiently. We apply the proposed data-driven multistage adaptive robust optimization to a multipurpose batch process scheduling problem using a dataset to demonstrate the superiority of the proposed method. Our proposed approach generates $13,851 more profits than those of multistage adaptive robust optimization with box set. Compared with the multistage adaptive robust optimization using kernel density estimation (KDE), the result returned from the proposed method generates $4,064 more profits.","bibtype":"book","author":"Ning, C. and You, F.","bibtex":"@book{\n title = {Batch process scheduling under uncertainty using data-driven multistage adaptive robust optimization},\n type = {book},\n year = {2017},\n source = {Chemical Engineering Transactions},\n identifiers = {[object Object]},\n volume = {61},\n id = {fce4729a-5d52-352a-9202-ce4a517b3ee1},\n created = {2017-12-15T21:38:14.513Z},\n file_attached = {false},\n profile_id = {f27171f8-b200-3870-9028-dcb6a084733d},\n last_modified = {2017-12-15T21:38:14.513Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {true},\n abstract = {Copyright © 2017, AIDIC Servizi S.r.l. This paper proposes a novel data-driven batch process scheduling approach based on multistage adaptive robust optimization coupled with robust kernel density estimation (RKDE). The kernelized iteratively re-weighted lease squares (KIRWLS) algorithm combined with kernel tricks are adopted to learn the probability density function from outlier-corrupted uncertain processing time data. We then propose a data-driven outlier-resilient uncertainty set for scheduling problem using the extracted distributional information. The proposed framework exhibits robustness to contamination of uncertainty data by integrating robust optimization with robust statistics. The batch process scheduling is then formulated as a data-driven multistage decision-making problem. By introducing affine decision rules for recourse variables, the resulting data-driven multistage adaptive robust optimization problem can be solved efficiently. We apply the proposed data-driven multistage adaptive robust optimization to a multipurpose batch process scheduling problem using a dataset to demonstrate the superiority of the proposed method. Our proposed approach generates $13,851 more profits than those of multistage adaptive robust optimization with box set. Compared with the multistage adaptive robust optimization using kernel density estimation (KDE), the result returned from the proposed method generates $4,064 more profits.},\n bibtype = {book},\n author = {Ning, C. and You, F.}\n}","author_short":["Ning, C.","You, F."],"bibbaseid":"ning-you-batchprocessschedulingunderuncertaintyusingdatadrivenmultistageadaptiverobustoptimization-2017","role":"author","urls":{},"downloads":0},"search_terms":["batch","process","scheduling","under","uncertainty","using","data","driven","multistage","adaptive","robust","optimization","ning","you"],"keywords":[],"authorIDs":["5a445a67dd7f81802d00001d"]}