On the solution of large-scale mixed integer programming scheduling models

Abstract

We present extensions to discrete-time MIP model that allow to address realistic instances. We show how advanced solution methods can be extended and combined to address a wide range of problems. The proposed method yield (near) optimal solutions in time frames that can be used in practice. a b s t r a c tIn this paper, we show how four recently developed modeling and solution methods can be integrated to address mixed integer programs for the scheduling of large-scale chemical production systems. The first method uses multiple discrete time grids. The second adds tightening constraints that lower bound the total production and number of batches for each task and material based on the customer demand, while the third generates upper bounding constraints based on inventory and resource availability. The final method is a reformulation that introduces a new integer variable representing the total number of batches of a task. We apply the aforementioned methods to large-scale problems with a variety of processing features, including variable conversion coefficients, changeovers, various storage policies, continuous processing tasks, setups, and utilities, using a discrete-time model. We illustrate how these methods lead to significant improvements in computational performance.

A Computational Study of Continuous and Discrete Time Formulations for a Class of Short-Term Scheduling Problems for Multipurpose Plants

“…Such an approach has the advantage of obtaining a better balance between solution quality and computational demand, because finer discretizations are only used when needed, for example, for processing units with relatively short processing times. Velez et al 8 successfully implemented the multigrid approach to solve three large examples, including a case study based on production operations by the Dow Chemical Co., while extending the approach to consider various features including changeovers and storage policies.…”

Novel Multiple Time-grid Continuous-time Mathematical Formulation for Short-term Scheduling of Multipurpose Batch Plants

“…Schedules for motivating example 2. (a) Best schedule with a makespan of 11.5 h from representative models; ,,, (b) a better schedule with a makespan of 8 h obtained manually.…”

Optimization-Based Scheduling for the Process Industries: From Theory to Real-Life Industrial Applications

“…A strategic planning tool was developed based on the proposed model and applied to an industrial plant, importing demand data from the plant's ERP (Enterprise Resource Planning) system. Additionally, four scheduling approaches have been developed by Velez et al [78]. Here the idea of multiple discrete-time grids is utilized, as each material, task and unit has its own time grid.…”