Advertisement

Cluster Computing

, Volume 22, Supplement 2, pp 3419–3429 | Cite as

Improved hybrid immune clonal selection genetic algorithm and its application in hybrid shop scheduling

  • Gaoxiang LouEmail author
  • Zongyan Cai
Article
  • 116 Downloads

Abstract

This paper is based on the multi-objective optimization problem of mixed shop scheduling problem, the strong coupling of the maximum flow and the minimum time, and the deficiencies of the immune genetic algorithm including high computational complexity and high spatial dimension. This paper establishes a mixed shop scheduling mathematical model with the minimization of the maximum total completion time as the target, and puts forward to use the immune clonal selection algorithm to solve the problem. In the algorithm population construction, it uses the grouping strategy, introduces the cross and delete operator, retains the excellent individuals through memory space, deletes the relatively bad individual, and improves the algorithm’s global optimization ability. In order to verify the effectiveness of the proposed algorithm, under the two experimental environments of workpiece machining and automobile shock absorber processing workshop scheduling, simulation experiments are conducted. The experimental results show that the proposed algorithm has better performance, and can achieve smaller maximum total completion time with less iteration. The algorithm can find the global optimal solution of the multi-objective problem, which has a strong practical significance.

Keywords

Hybrid shop scheduling genetic algorithm Immune clone selection operation Memory space Parallel scheduling 

Notes

Acknowledgements

This research is supported by the foundation of National Science Foundation for Young Science Funding Project: Research on Multi-Dimensional Uncertain Environment for Manufacturing/Remanufacturing Hybrid System Modeling and Optimization Control (Granted by: No. 51305042).

References

  1. 1.
    Rubén, R., Vázquez-Rodríguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1–18 (2010)Google Scholar
  2. 2.
    Linn, R., Zhang, W.: Hybrid flow shop scheduling: a survey. Comput. Ind. Eng. 37(1-2), 57–61 (1999)Google Scholar
  3. 3.
    Engin, O., Döyen, A.: A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Gener. Comput. Syst. 20(6), 1083–1095 (2004)Google Scholar
  4. 4.
    Ribas, I., Leisten, R., Framiñan, J.M.: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput. Oper. Res. 37(8), 1439–1454 (2010)Google Scholar
  5. 5.
    Dugardin, F., Yalaoui, F., Amodeo, L.: New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur. J. Oper. Res. 203(1), 22–31 (2010)Google Scholar
  6. 6.
    Hofmeyr, S.A., Forrest, S.: Architecture for an artificial immune system. Architecture 8(4), 443–473 (2006)Google Scholar
  7. 7.
    Hofmeyr, S.A., Stephanie F.: Immunity by design: An artificial immune system. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation-Volume 2. Morgan Kaufmann Publishers Inc. (1999)Google Scholar
  8. 8.
    Marichelvam, M.K., Prabaharan, T., Yang, X.S.: Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl. Soft Comput. 19, 93–101 (2014)Google Scholar
  9. 9.
    Li, J., Pan, Q.: Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Inf. Sci. 316, 487–502 (2015)Google Scholar
  10. 10.
    Abdollahpour, S., Rezaeian, J.: Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system. Appl. Soft Comput. 28, 44–56 (2015)Google Scholar
  11. 11.
    De Castro L.N., Von Zuben F.J.: The clonal selection algorithm with engineering applications. In: Proceedings of GECCO, vol. 2000: pp 36–39 (2000)Google Scholar
  12. 12.
    De Castro, L.N., Leandro, N., Von Zuben, J.: Learning and optimization using the clonal selection principle. IEEE Trans. Evol. Comput. 6(3), 239–251 (2002)Google Scholar
  13. 13.
    Kim, J., Bentley, P.J: Immune memory in the dynamic clonal selection algorithm. In: Proceedings of the First International Conference on Artificial Immune Systems ICARIS (2002)Google Scholar
  14. 14.
    Chung, T.P., Liao, C.J.: An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem. Appl. Soft Comput. 13(8), 3729–3736 (2013)Google Scholar
  15. 15.
    Yenisey, M.M., Yagmahan, B.: Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends. Omega 45, 119–135 (2014)Google Scholar
  16. 16.
    Xu, Y., et al.: An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem. Eng. Optim. 46(9), 1269–1283 (2014)Google Scholar
  17. 17.
    Luo, J., Xie, J.: Parameter estimation for nonlinear Muskingum model based on immune clonal selection algorithm. J. Hydrol. Eng. 15(10), 844–851 (2010)Google Scholar
  18. 18.
    Vairamuthu, M., et al.: Artificial Immune System algorithm for multi objective flow shop scheduling problem. Int. J. Innov. Res. Sci. Eng. Technol. 3(3), 1391–1395 (2014)Google Scholar
  19. 19.
    Shang, R.H., et al.: An immune clonal algorithm for dynamic multi-objective optimization. Ruan Jian Xue Bao 18(11), 2700–2711 (2007)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Construction MachineryChang’an UniversityXi’anChina

Personalised recommendations