Single Reference Grid Continuous-Time Formulation for Batch Scheduling

Abstract

Abstract Short term scheduling of multipurpose batch processes has received growing attention over past decades. It concerns the optimal allocation of a set of limited resources to tasks over time in order to enhance the revenue of plants. This paper addresses the short term scheduling of batch processes through a continuous-time mixed integer linear programming (MILP) formulation based on the state-task network (STN) representation that allows to consider multiple intermediate due dates for market requirements. The proposed formulation can be classified as a slot-based approach that views the time horizon as a set of ordered blocks of unknown and variable lengths. Compared to previous similar approaches, it is simpler and leads to a smaller mathematical model without decoupling tasks from units. A few benchmark problems are used to illustrate the computational advantages of the proposed optimization approach.