Milp-based Campaign Scheduling In A Specialty Chemicals Plant: A Case Study

摘要

Supply chain management in chemical process industry focuses on production planning and scheduling to reduce production cost and inventories and simultaneously increase the utilization of production capacities and the service level. These objectives and the specific characteristics of chemical production processes result in complex planning problems. To handle this complexity, advanced planning systems (APS) are implemented and often enhanced by tailor-made optimization algorithms. In this article, we focus on a real-world problem of production planning arising from a specialty chemicals plant. Formulations for finished products comprise several production and refinement processes which result in all types of material flows. Most processes cannot be operated on only one multi-purpose facility, but on a choice of different facilities. Due to sequence dependencies, several batches of identical processes are grouped together to form production campaigns. We describe a method for multicriteria optimization of short- and mid-term production campaign scheduling which is based on a time-continuous MILP formulation. In a preparatory step, deterministic algorithms calculate the structures of the formulations and solve the bills of material for each primary demand. The facility selection for each production campaign is done in a first MILP step. Optimized campaign scheduling is performed in a second step, which again is based on MILP. We show how this method can be successfully adapted to compute optimized schedules even for problem instances of real-world size, and we furthermore outline implementation issues including integration with an APS.