A novel metaheuristic framework for the scheduling of multipurpose batch plants

Abstract A genetic algorithm (GA) is proposed along with a novel general framework for the scheduling of a typical multipurpose/product batch plant. The majority of literature regarding these problems make use of mathematical programming methods. Modelling problems in this manner leads to numerous binary variables relating to material balance and sequence of batches along long-time horizons, thus resulting in large computational time. The proposed GA does not suffer the same scalability issues of mathematical programming approaches. The GA makes use of a coupled chromosome system with specific crossover and mutation functions utilised with the purpose of profit maximisation. Results show that optimal or close-to-optimal solutions can be achieved with a reduction of up to 98.53 % computational time in certain cases.

[1]  R. Sargent,et al.  The optimal operation of mixed production facilities—a general formulation and some approaches for the solution , 1996 .

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

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

[4]  G. Reklaitis,et al.  Continuous Time Representation Approach to Batch and Continuous Process Scheduling. 1. MINLP Formulation , 1999 .

[5]  C. Pantelides,et al.  A simple continuous-time process scheduling formulation and a novel solution algorithm , 1996 .

[6]  Chi Wai Hui,et al.  A binary coding genetic algorithm for multi-purpose process scheduling: A case study , 2010 .

[7]  Serge Domenech,et al.  A two-stage methodology for short-term batch plant scheduling , 1998 .

[8]  Chi Wai Hui,et al.  Genetic algorithm based on heuristic rules for high-constrained large-size single-stage multi-product scheduling with parallel units , 2007 .

[9]  C. Floudas,et al.  Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch Processes , 1998 .

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

[11]  Chi Wai Hui,et al.  Rule-Evolutionary Approach for Single-Stage Multiproduct Scheduling with Parallel Units , 2006 .

[12]  Thokozani Majozi,et al.  A novel technique for prediction of time points for scheduling of multipurpose batch plants , 2012 .

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

[14]  Christodoulos A. Floudas,et al.  Continuous-Time Models for Short-Term Scheduling of Multipurpose Batch Plants: A Comparative Study , 2006 .

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

[16]  X. Zhu,et al.  A Novel Continuous-Time MILP Formulation for Multipurpose Batch Plants. 1. Short-Term Scheduling , 2001 .

[17]  Ignacio E. Grossmann,et al.  New general continuous-time state-task network formulation for short-term scheduling of multipurpose batch plants , 2003 .

[18]  Thokozani Majozi,et al.  A robust mathematical formulation for multipurpose batch plants , 2012 .

[19]  Jorge Cantón Padilla.  Integrated support system for planning and scheduling of batch chemical plants , 2003 .

[20]  Fred W. Glover,et al.  Multi-objective process design in multi-purpose batch plants using a Tabu Search optimization algorithm , 2004, Comput. Chem. Eng..