| Popis: |
In this paper, based on the cyclic scheduling formulation of Schilling and Pantelides [22], we propose a continuous time mixed integer linear programming (MILP) formulation for the cyclic scheduling of a mixed plant, i.e. a plant composed of batch and continuous tasks. The cycle duration is a variable of the model and the objective is to maximize productivity. By using strengthening techniques and the analysis of small polytopes related to the problem formulation, we strengthen the initial formulation by tightening some initial constraints and by adding valid inequalities. We show that this strengthened formulation is able to solve moderate size problems quicker than the initial one. However, for real size cases, it remains difficult to obtain the optimal solution of the scheduling problem quickly. Therefore, we introduce MILP-based heuristic methods in order to solve these larger instances, and show that they can provide quite good feasible solutions quickly. |
Full Text from ScienceDirect