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 条
  • [21] Gupta A.K., Sivakumar A.I., Optimization of due-date objectives in scheduling semiconductor batch manufacturing, Int. J. Machine Tools and Manufacture, 46, pp. 1671-1679, (2006)
  • [22] He Y., Hui C.-W., Genetic algorithm for large-size multi-stage batch plant scheduling, Chemical Engineering Science, 62, pp. 1504-1523, (2007)
  • [23] Hoogeveen H., Multicriteria scheduling, European Journal of Operational Research, 167, pp. 592-623, (2005)
  • [24] Jayaraman V., Kulkarni B., Karale S., Shelokar P., Ant colony framework for optimal design and scheduling of batch plants, Computers and Chemical Engineering, 24, pp. 1901-1912, (2000)
  • [25] Kashan A.H., Karimi B., Jolaiz F., Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes, Int. J. Production Research, 44, pp. 2337-2360, (2006)
  • [26] Koh S.G., Koo P.H., Kim D.C., Hur W.S., Scheduling a single-batch-processing machine with arbitrary job sizes and incompatible job families, Int. J. Production Economics, 98, pp. 81-96, (2005)
  • [27] Kondili E., Pantelides C.C., Sargent R.W.H., A general algorithm for short-term scheduling of batch operations I. MILP formulation, Computers and Chemical Engineering, 17, pp. 211-227, (1993)
  • [28] Ku H.M., Karimi I.A., Scheduling in serial multiproduct batch processes with due-date penalties, Industrial and Engineering Chemical Research, 29, pp. 580-590, (1990)
  • [29] Ku H.M., Karimi I.A., Scheduling algorithms for serial multiproduct batch processes with tardiness penalties, Computers and Chemical Engineering, 15, pp. 283-286, (1991)
  • [30] Ku H.M., Rajagopalan D., Karimi I.A., Scheduling in batch processes, Chemical Engineering Progress, 83, pp. 35-45, (1987)
123456