% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Schfer:888781,
      author       = {Schäfer, Pascal and Schweidtmann, Artur M. and Mitsos,
                      Alexander},
      title        = {{N}onlinear scheduling with time‐variable electricity
                      prices using sensitivity‐based truncations of wavelet
                      transforms},
      journal      = {AIChE journal},
      volume       = {66},
      number       = {10},
      issn         = {1547-5905},
      address      = {Hoboken, NJ},
      publisher    = {Wiley},
      reportid     = {FZJ-2020-05210},
      pages        = {e16986},
      year         = {2020},
      abstract     = {We propose an algorithm for scheduling subject to
                      time‐variable electricity prices using nonlinear process
                      models that enables long planning horizons with fine
                      discretizations. The algorithm relies on a reduced‐space
                      formulation and enhances our previous work (Schäfer et al.,
                      Comput Chem Eng, 2020;132:106598) by a sensitivity‐based
                      refinement procedure. We therein expose the coefficients of
                      the wavelet transform of the time series of independent
                      process variables to the optimizer. The problem size is
                      reduced by truncating the transform and iteratively adjusted
                      using Lagrangian multipliers. We apply the algorithm to the
                      scheduling of a multi‐product air separation unit. The
                      nonlinear power consumption characteristic is replaced by an
                      artificial neural network trained on data from a rigorous
                      model. We demonstrate that the proposed algorithm reduces
                      the number of optimization variables by more than one order
                      of magnitude, whilst furnishing feasible schedules with
                      insignificant losses in objective values compared to
                      solutions considering the full dimensionality.},
      cin          = {IEK-10},
      ddc          = {660},
      cid          = {I:(DE-Juel1)IEK-10-20170217},
      pnm          = {899 - ohne Topic (POF3-899)},
      pid          = {G:(DE-HGF)POF3-899},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:000563864100001},
      doi          = {10.1002/aic.16986},
      url          = {https://juser.fz-juelich.de/record/888781},
}