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

被引：1
作者：
Mansour M.A.A.-F. [1 ]
Dessouky M.M. [2 ]
机构：
[1] Faculty of Engineering, Industrial Engineering Department, Zagazig University, Zagazig
[2] Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles
来源：
International Journal of Industrial and Systems Engineering | 2010年 / 5卷 / 02期
关键词：
Batch processor; Batching; Earliness and tardiness; Genetic algorithms; Scheduling;
D O I：
10.1504/IJISE.2010.030745
中图分类号：
学科分类号：
摘要：
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. Copyright © 2010 Inderscience Enterprises Ltd.
引用
收藏
页码：143 / 158
页数：15
相关论文
共 51 条
  • [41] Pekny J.F., Miller D.L., McRae G.J., An exact parallel algorithm for scheduling when production costs depend on consecutive system states, Computers and Chemical Engineering, 14, pp. 1009-1023, (1990)
  • [42] Perez I.C., Fowler J.W., Carlyle W.M., Minimizing total weighted tardiness on a single batch process machine with incompatible job families, Computers and Operations Research, 32, pp. 327-341, (2005)
  • [43] Poon C.K., Zhang P., Minimizing makespan in batch machine scheduling, Algorithmica, 39, pp. 155-174, (2004)
  • [44] Rippin D.W., The big advantage offered by batch processing is flexibility, Chemical Engineering, 89, pp. 101-107, (1991)
  • [45] Sadrieh S., Ghaeli M., Bahri P., Lee P., An integrated petri net and GA based approach for scheduling of hybrid plants, Computers in Industry, 56, pp. 519-530, (2007)
  • [46] Mazumdar S.C., Mathirajan M., Gopinath R., Sivakumar A.I., Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints, Int. J. Operational Research, 3, pp. 119-139, (2008)
  • [47] Sung C.S., Choung Y.I., Minimizing makespan on a single burn-in oven in semiconductor manufacturing, European Journal of Operational Research, 120, pp. 559-574, (2000)
  • [48] Sung C.S., Choung Y.I., Fowler J., Heuristic algorithm for minimizing earliness tardiness on a single burn-in oven in semiconductor manufacturing, Proceedings of the International Conference on Modeling and Analysis of Semiconductor Manufacturing, pp. 217-222, (2002)
  • [49] Tandon M., Cummings P.T., Levan M.D., Flowshop sequencing with nonpermutation schedules, Computers and Chemical Engineering, 15, pp. 601-607, (1991)
  • [50] Wang C.-S., Uzsoy R., A genetic algorithm to minimize maximum lateness on a batch processing machine, Computers and Operations Research, 29, pp. 1621-1640, (2002)
123456