Production , Manufacturing and Logistics Discrete and continuous time representations and mathematical models for large production scheduling problems : A case study from the pharmaceutical industry

The underlying time framework used is one of the major differences in the basic structure of mathematical programming formulations used for production scheduling problems. The models are either based on continuous or discrete time representations. In the literature there is no general agreement on which is better or more suitable for different types of production or business environments. In this paper we study a large real-world scheduling problem from a pharmaceutical company. The problem is at least NP-hard and cannot be solved with standard solution methods. We therefore decompose the problem into two parts and compare discrete and continuous time representations for solving the individual parts. Our results show pros and cons of each model. The continuous formulation can be used to solve larger test cases and it is also more accurate for the problem under consideration.

[1]  Ignacio E. Grossmann,et al.  New General Continuous-Time State−Task Network Formulation for Short-Term Scheduling of Multipurpose Batch Plants , 2003 .

[2]  Deming Lei,et al.  Multi-objective production scheduling: a survey , 2009 .

[3]  Josef Kallrath,et al.  Mixed-Integer Nonlinear Programming Applications , 1999 .

[4]  Ignacio E. Grossmann,et al.  Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods , 2002 .

[5]  Jaime Cerdá,et al.  An MILP-based approach to the short-term scheduling of make-and-pack continuous production plants , 2002, OR Spectr..

[6]  Iftekhar A. Karimi,et al.  An Improved MILP Formulation for Scheduling Multiproduct, Multistage Batch Plants , 2003 .

[7]  Ignacio E. Grossmann,et al.  Time representations and mathematical models for process scheduling problems , 2011, Comput. Chem. Eng..

[8]  Christodoulos A. Floudas,et al.  Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications , 2005, Ann. Oper. Res..

[9]  Ignacio E. Grossmann,et al.  Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks , 2003, Comput. Chem. Eng..

[10]  Dan Wu,et al.  Decomposition approaches for the efficient solution of short-term scheduling problems , 2003, Comput. Chem. Eng..

[11]  Ramkumar Karuppiah,et al.  Overview of Planning and Scheduling for Enterprise-wide Optimization of Process Industries (Übersicht über Planungs- und Feinplanungssysteme für die unternehmensweite Optimierung in der verfahrenstechnischen Industrie , 2008, Autom..

[12]  Manfred Morari,et al.  Hybrid systems modeling - parametric programming, and model predictive control - impact on process operations , 2004 .

[13]  Jaime Cerdá,et al.  State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..

[14]  N. Giannelos,et al.  A Simple New Continuous-Time Formulation for Short-Term Scheduling of Multipurpose Batch Processes , 2002 .

[15]  Jaime Cerdá,et al.  An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities , 2001 .

[16]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[17]  Paul I. Barton,et al.  Design of process operations using hybrid dynamic optimization , 2004, Comput. Chem. Eng..

[18]  P. Castro,et al.  Two New Continuous-Time Models for the Scheduling of Multistage Batch Plants with Sequence Dependent Changeovers , 2006 .

[19]  Christos T. Maravelias,et al.  Integration of production planning and scheduling: Overview, challenges and opportunities , 2009, Comput. Chem. Eng..

[20]  Ignacio E. Grossmann,et al.  Enterprise‐wide optimization: A new frontier in process systems engineering , 2005 .

[21]  Ignacio E. Grossmann,et al.  On the relation of continuous‐ and discrete‐time state–task network formulations , 2006 .

[22]  Christodoulos A. Floudas,et al.  Enhanced Continuous-Time Unit-Specific Event-Based Formulation for Short-Term Scheduling of Multipurpose Batch Processes: Resource Constraints and Mixed Storage Policies. , 2004 .

[23]  Christodoulos A. Floudas,et al.  Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review , 2004, Comput. Chem. Eng..

[24]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations */I , 1993 .

[25]  C. Floudas,et al.  Global optimization in the 21st century: Advances and challenges , 2005, Computers and Chemical Engineering.

[26]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations—II. Computational issues , 1993 .

[27]  S. Engell,et al.  Planning and Scheduling in the Process Industry , 2022 .