A hybrid genetic algorithm for solving the joint batching and scheduling of a batch processor with earliness and tardiness penalties

In this article, we address the problem of minimising the total weighted earliness and tardiness penalties of a batch processor by integrating genetic algorithms and math programming for determining the allocation of the customer orders to production batches and scheduling the resulting batches. Each job has its own unique due date, and earliness and tardiness penalties. A genome representation is introduced for solving the scheduling problem and is evolved by a genetic algorithm while at each evolution, the genome score is evaluated by a mathematical program for determining the job size per batch and the formation of batches. The genetic algorithm's performance is compared with solutions found by a non-linear integer math program solver and its linearised model proposed by Dessouky, Kijowski and Verma (1999) on a set of representative test problems. The developed hybrid genetic algorithm proves its capability and superiority to find good solutions for the problem under consideration and outperforms solutions from a commercial optimisation package, CPLEX.

[1]  Joseph F. Pekny,et al.  An exact parallel algorithm for scheduling when production costs depend on consecutive system states , 1990 .

[2]  Reha Uzsoy,et al.  A genetic algorithm to minimize maximum lateness on a batch processing machine , 2002, Comput. Oper. Res..

[3]  Maged Dessouky,et al.  Scheduling multi-purpose batch plants with junction constraints , 1996 .

[4]  Peter L. Lee,et al.  An integrated Petri net and GA based approach for scheduling of hybrid plants , 2007, Comput. Ind..

[5]  V. K. Jayaraman,et al.  Ant colony framework for optimal design and scheduling of batch plants , 2000 .

[6]  Peter T. Cummings,et al.  Flowshop sequencing with non-permutation schedules , 1991 .

[7]  G. Reklaitis,et al.  HEURISTIC ALGORITHM FOR SCHEDULING BATCH AND SEMI-CONTINUOUS PLANTS WITH PRODUCTION DEADLINES, INTERMEDIATE STORAGE LIMITATIONS AND EQUIPMENT CHANGEOVER COSTS , 1994 .

[8]  H. Ku,et al.  Scheduling in serial multiproduct batch processes with due-date penalties , 1990 .

[9]  P. Chang,et al.  A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem , 2006 .

[10]  Iftekhar A. Karimi,et al.  Scheduling in batch processes , 1987 .

[11]  M. Dessouky,et al.  Production scheduling of single-stage multi-product batch chemical processes with fixed batch sizes , 1997 .

[12]  Xiaotie Deng,et al.  On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time , 2004, J. Comb. Optim..

[13]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

[14]  John W. Fowler,et al.  Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times , 2005, Comput. Oper. Res..

[15]  Chung Keung Poon,et al.  Minimizing Makespan in Batch Machine Scheduling , 2000, Algorithmica.

[16]  Reha Uzsoy,et al.  Minimizing total completion time on batch processing machines , 1993 .

[17]  Pyung-Hoi Koo,et al.  Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families , 2005 .

[18]  John W. Fowler,et al.  Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness , 2004 .

[19]  Xiaotie Deng,et al.  A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling , 2002, IPCO.

[20]  Purushothaman Damodaran,et al.  Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing , 2004 .

[21]  Maged Dessouky,et al.  Sequence-dependent batch chemical scheduling with earliness and tardiness penalties , 2001 .

[22]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[23]  Iftekhar A. Karimi,et al.  Scheduling algorithms for serial multiproduct batch processes with tardiness penalties , 1991 .

[24]  Meral Azizoglu,et al.  Scheduling a batch processing machine with incompatible job families , 2001 .

[25]  Jeffrey C. Kantor,et al.  Scheduling of a multipurpose batch plant using a graphically derived mixed-integer linear program model , 1991 .

[26]  M. Mathirajan,et al.  Tabu Search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints , 2008 .

[27]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[28]  John W. Fowler,et al.  Minimizing total weighted tardiness on a single batch process machine with incompatible job families , 2005, Comput. Oper. Res..

[29]  Ignacio E. Grossmann,et al.  Multiperiod LP models for simultaneous production planning and scheduling in multiproduct batch plants , 1990 .

[30]  Lars Mönch,et al.  Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint , 2006, OR Spectr..

[31]  Clarisse Dhaenens,et al.  Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure , 2002, Comput. Oper. Res..

[32]  M. Mathirajan,et al.  A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor , 2006 .

[33]  Fuh-Der Chou,et al.  SCHEDULING FOR A SINGLE SEMICONDUCTOR BATCH-PROCESSING MACHINE TO MINIMIZE TOTAL WEIGHTED TARDINESS , 2008 .

[34]  Xiaoqiang Cai,et al.  On‐line algorithms for minimizing makespan on batch processing machines , 2001 .

[35]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[36]  Frank Werner,et al.  Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey , 2004, Math. Comput. Model..

[37]  Pei-Chann Chang,et al.  Dynamic Scheduling Problem of Batch Processing Machine in Semiconductor Burn-in Operations , 2005, ICCSA.

[38]  Pei-Chann Chang,et al.  A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes , 2004 .

[39]  Sushil Verma,et al.  SIMULTANEOUS BATCHING AND SCHEDULING FOR CHEMICAL PROCESSING WITH EARLINESS AND TARDINESS PENALTIES , 2009 .

[40]  Appa Iyer Sivakumar,et al.  Optimization of due-date objectives in scheduling semiconductor batch manufacturing , 2006 .

[41]  Chi Wai Hui,et al.  Genetic algorithm for large-size multi-stage batch plant scheduling , 2007 .

[42]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..

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

[44]  Fariborz Jolai,et al.  Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes , 2006 .

[45]  C. S. Sung,et al.  Minimizing makespan on a single burn-in oven in semiconductor manufacturing , 2000, Eur. J. Oper. Res..

[46]  Meral Azizoglu,et al.  Scheduling a batch processing machine with non-identical job sizes , 2000 .

[47]  Purushothaman Damodaran,et al.  Scheduling a capacitated batch-processing machine to minimize makespan , 2007 .