Scheduling a Hybrid Flow-Shop Problem via Artificial Immune System

This paper investigates a two-stage hybrid flowshop problem with a single batch processing machine in the first stage and a single machine in the second stage. In the problem, each job has an individual release time and the jobs are grouped into several batches. To be more practical in real applications, the waiting time between the batch machine and the single machine is restricted. Since the problem is NP-hard, an immunoglobulin-based artificial immune system (IAIS) algorithm is developed to find an optimal or near-optimal solution. To verify IAIS, comparisons with two lower bounds in the second problem are made. Computational results show that the proposed IAIS algorithm is quite stable and efficient.

[1]  L. Su.  A hybrid two-stage flowshop with limited waiting time constraints , 2003 .

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

[3]  Ammar Oulamara.  Makespan minimization in a no-wait flow shop problem with two batching machines , 2007, Comput. Oper. Res..

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

[5]  Lixin Tang,et al.  A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times , 2010, Comput. Oper. Res..

[6]  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..

[7]  Jinjiang Yuan,et al.  The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan , 2008, Theor. Comput. Sci..

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

[9]  Ammar Oulamara,et al.  Scheduling hybrid flowshop with parallel batching machines and compatibilities , 2009, Comput. Oper. Res..

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

[11]  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).

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

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

[14]  Ling-Huey Su,et al.  Sequencing two-stage flowshop with nonidentical job sizes , 2010 .

[15]  Appa Iyer Sivakumar,et al.  Optimisation of flow-shop scheduling with batch processor and limited buffer , 2012 .

[16]  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..

[17]  Hua Xuan,et al.  Scheduling a hybrid flowshop with batch production at the last stage , 2007, Comput. Oper. Res..

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