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 条
  • [1] Azizoglu M., Webster S., Scheduling a batch processing machine with non-identical job-sizes, Int. J. Production Research, 38, pp. 2173-2184, (2000)
  • [2] Azizoglu M., Webster S., Scheduling a batch processing machine with incompatible job families, Computers and Industrial Engineering, 39, pp. 325-335, (2001)
  • [3] Baker K.R., Scudder G.D., Sequencing with earliness and tardiness penalties a review, Operations Research, 38, pp. 22-36, (1990)
  • [4] Balasubramanian H., Monch L., Fowler J., Pfund M., Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness, Int. J. Production Research, 42, pp. 1621-1638, (2004)
  • [5] Birewar D.B., Grossmann I.E., Simultaneous production planning and scheduling in multiproduct batch plants, Industrial and Engineering Chemical Research, 29, pp. 570-580, (1990)
  • [6] Brucker P., Gladky A., Hoogeveen H., Kovalyov M.Y., Potts C., Tautenhahn T., Van De Velde S., Scheduling a batching machine, Journal of Scheduling, 1, pp. 31-54, (1998)
  • [7] Cai M.-C., Deng X., Feng H., Li G., Liu G., A PTAS for minimizing total completion time of bounded batch scheduling, Lecture Notes in Computer Science, 2337, pp. 304-314, (2002)
  • [8] Chandru V., Lee C.-Y., Uzsoy R., Minimizing total completion time on a batch processing machines, Int. J. Production Research, 31, pp. 2097-2212, (1993)
  • [9] Chang P.C., Wang H.M., A heuristic for a batch processing machine scheduled to minimize total completion time with non-identical job sizes, Int. J. Advanced Manufactured Technology, 24, pp. 615-620, (2004)
  • [10] Chang P.C., Chen Y.S., Wang H.M., Dynamic scheduling problem of batch processing machine in semiconductor burn-in operations, Lecture Notes in Computer Science, 3483, pp. 172-181, (2005)
123456