Scheduling batch processing machine problem with non-identical job sizes via artificial immune system

Abstract This paper considers a single batch processing machine problem, in this problem, jobs with release time and size will be assigned into some batches and processed aiming to minimize makespan. Given that this problem is NP-hard, an immunoglobulin-based artificial immune system (IAIS) algorithm is used to solve the problem. The proposed IAIS algorithm has two meaningful features. First, the searching area is limited in the somatic recombination process in order to decrease the computational time. Second, several local search methods are mixed for use in each run to change neighbor and escape from local optimum. Comparisons with an algorithm for the problem are shown to verify proposed IAIS. Comparisons results have shown that the proposed IAIS algorithm has a better performance than the existing algorithm.

[1]  Reha Uzsoy,et al.  A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families , 2007, Comput. Oper. Res..

[2]  Rui Xu,et al.  Earliness-tardiness minimization on scheduling a batch processing machine with non-identical job sizes , 2015, Comput. Ind. Eng..

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

[4]  Gary G. Yen,et al.  Vaccine-Enhanced Artificial Immune System for Multimodal Function Optimization , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[6]  Rui Xu,et al.  Makespan minimization on single batch-processing machine via ant colony optimization , 2012, Comput. Oper. Res..

[7]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

[8]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[9]  Ching-Jen Huang,et al.  Tabu search heuristic for two-machine flowshop with batch processing machines , 2011, Comput. Ind. Eng..

[10]  Xianwen Meng,et al.  A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines , 2015, J. Intell. Manuf..

[11]  Xin Chen,et al.  Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm , 2009 .

[12]  Yanchun Liang,et al.  An Effective PSO and AIS-Based Hybrid Intelligent Algorithm for Job-Shop Scheduling , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[13]  Xiaoli Wang,et al.  Minimizing makespan on a single batching machine with release times and non-identical job sizes , 2005, Oper. Res. Lett..

[14]  Mostafa Zandieh,et al.  An artificial immune algorithm for the flexible job-shop scheduling problem , 2010, Future Gener. Comput. Syst..

[15]  Li-Chen Fu,et al.  A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival , 2010, Comput. Oper. Res..

[16]  Muhammad Al-Salamah,et al.  Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes , 2015, Appl. Soft Comput..

[17]  Manoj Kumar Tiwari,et al.  Modified immune algorithm for job selection and operation allocation problem in flexible manufacturing systems , 2008, Adv. Eng. Softw..

[18]  Ali Husseinzadeh Kashan,et al.  A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes , 2008, Comput. Oper. Res..