An Improved Immune Algorithm for Manufacturing Scheduling

This paper addresses an n-job, m-machine permutation flow shop scheduling problem to minimize makespan criterion. We present a modification of the best-known immune algorithm of Engin and Döyen (2004) [A new approach to solve hybrid flowshop scheduling problems by artificial immune system. Future Generations Computer Systems 2004;20:1083-1095] for this problem. To evaluate the solution quality and efficiency of the proposed method, the experiments are carried out in two phases on a set of benchmark problems and analyzed. We show, through computational experimentation, that this modification considerably improves its performance without affecting its time complexity. The proposed method also has been compared with the currently best simulated annealing from the literature.

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

[3]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[4]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

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

[6]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[7]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[8]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[9]  Subhash C. Sarin,et al.  A heuristic to minimize total flow time in permutation flow shop , 2009 .

[10]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[11]  Dipankar Dasgupta,et al.  Artificial immune systems in industrial applications , 1999, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296).

[12]  Z. A. Lomnicki,et al.  Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[13]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[14]  D. Dasgupta.  Artificial Immune Systems and Their Applications , 1998, Springer Berlin Heidelberg.

[15]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[16]  Jonathan Timmis,et al.  Artificial Immune Systems: A New Computational Intelligence Approach , 2003 .

[17]  Uday Kumar Chakraborty,et al.  An efficient stochastic hybrid heuristic for flowshop scheduling , 2007, Eng. Appl. Artif. Intell..

[18]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[19]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[20]  Leandro Nunes de Castro,et al.  The Clonal Selection Algorithm with Engineering Applications 1 , 2000 .

[21]  Jonathan Timmis,et al.  Application areas of AIS: The past, the present and the future , 2008, Appl. Soft Comput..