Robust Batch Process Scheduling in Pharmaceutical Industries: A Case Study

Authors: Tommaso Adamo, Gianpaolo Ghiani, Antonio D. Grieco, Emanuela Guerriero

Abstract:

Batch production plants provide a wide range of scheduling problems. In pharmaceutical industries a batch process is usually described by a recipe, consisting of an ordering of tasks to produce the desired product. In this research work we focused on pharmaceutical production processes requiring the culture of a microorganism population (i.e. bacteria, yeasts or antibiotics). Several sources of uncertainty may influence the yield of the culture processes, including (i) low performance and quality of the cultured microorganism population or (ii) microbial contamination. For these reasons, robustness is a valuable property for the considered application context. In particular, a robust schedule will not collapse immediately when a cell of microorganisms has to be thrown away due to a microbial contamination. Indeed, a robust schedule should change locally in small proportions and the overall performance measure (i.e. makespan, lateness) should change a little if at all. In this research work we formulated a constraint programming optimization (COP) model for the robust planning of antibiotics production. We developed a discrete-time model with a multi-criteria objective, ordering the different criteria and performing a lexicographic optimization. A feasible solution of the proposed COP model is a schedule of a given set of tasks onto available resources. The schedule has to satisfy tasks precedence constraints, resource capacity constraints and time constraints. In particular time constraints model tasks duedates and resource availability time windows constraints. To improve the schedule robustness, we modeled the concept of (a, b) super-solutions, where (a, b) are input parameters of the COP model. An (a, b) super-solution is one in which if a variables (i.e. the completion times of a culture tasks) lose their values (i.e. cultures are contaminated), the solution can be repaired by assigning these variables values with a new values (i.e. the completion times of a backup culture tasks) and at most b other variables (i.e. delaying the completion of at most b other tasks). The efficiency and applicability of the proposed model is demonstrated by solving instances taken from a real-life pharmaceutical company. Computational results showed that the determined super-solutions are near-optimal.

Keywords: Constraint programming, super-solutions, robust scheduling, batch process, pharmaceutical industries.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1108476

References:

[1] C. T. Maravelias and I. E. Grossmann, “Using milp and cp for the scheduling of batch chemical processes,” in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer, 2004, pp. 1–20.
[2] T. Maravelias and I. E. Grossmann, “A hybrid milp/cp decomposition approach for the scheduling of batch plants,” in Proceedings of CP-AI-OR, 2003.
[3] M. Hegyh´ati, T. Majozi, T. Holczinger, and F. Friedler, “Practical infeasibility of cross-transfer in batch plants with complex recipes: S-graph vs milp methods,” Chemical Engineering Science, vol. 64, no. 3, pp. 605–610, 2009.
[4] W. T. Hess, A. Kurtz, and D. Stanton, “Kirk-othmer encyclopedia of chemical technology,” John Wiley & Sons Ltd., New York, 1995.
[5] E. Hebrard, B. Hnich, and T. Walsh, “Super solutions in constraint programming,” in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer, 2004, pp. 157–172.
[6] “Project of the future: Industry 4.0,” http://www.bmbf.de/en/19955.php.