Continuous-time scheduling formulation for multipurpose batch plants

Hossein Mostafaei, Iiro Harjunkoski*

*Tämän työn vastaava kirjoittaja

Tutkimustuotos: LehtiartikkeliArticleScientificvertaisarvioitu

7 Sitaatiot (Scopus)
61 Lataukset (Pure)

Abstrakti

Short-term scheduling of batch processes is a complex combinatorial problem with remarkable impact on the total revenue of chemical plants. It consists of the optimal allocation of limited resources to tasks over time in order to manufacture final products following given batch recipes. This article addresses the short-term scheduling of multipurpose batch plants, using a mixed integer linear programming formulation based on the state-task network representation. It employs both single-grid and multi-grid continuous-time representations, derived from generalized disjunctive programming. In comparison to other multigrid scheduling models in the literature, the proposed multi-grid model uses no big-M constraints and leads to more compact mathematical models with strong linear relaxations, which often results in shorter computational times. The single-grid counterpart of the formulation is not as favorable, as it leads to weaker linear relaxations than the multi-grid approach and is not capable of handling changeover time constraints.

AlkuperäiskieliEnglanti
Artikkelie16804
Sivumäärä16
JulkaisuAIChE Journal
Vuosikerta66
Numero2
Varhainen verkossa julkaisun päivämäärä2019
DOI - pysyväislinkit
TilaJulkaistu - 1 helmikuuta 2020
OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

Sormenjälki

Sukella tutkimusaiheisiin 'Continuous-time scheduling formulation for multipurpose batch plants'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä