Continuous‐time scheduling formulation for multipurpose batch plants

Abstract

AbstractShort‐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.